Update Merge Strings Alternately - Leetcode 1768.py

Author: gahogg

Merge Strings Alternately - Leetcode 1768/Merge Strings Alternately - Leetcode 1768.py

@@ -1,3 +1,38 @@
+# Brute Force Solution
+class Solution:
+    def mergeAlternately(self, word1: str, word2: str) -> str:
+        characters = ""
+        cur_word = 1
+        a, b = 0, 0
+
+        while a < len(word1) and b < len(word2):
+            if cur_word == 1:
+                characters += word1[a]
+                a += 1
+                cur_word = 2
+            else:
+                characters += word2[b]
+                b += 1
+                cur_word = 1
+        
+        while a < len(word1):
+            characters += word1[a]
+            a += 1
+        
+        while b < len(word2):
+            characters += word2[b]
+            b += 1
+        
+        return characters
+        # Let A be the length of Word1
+        # Let B be the length of Word2
+        # Let T = A + B
+        
+        # Time: O(T^2)
+        # Space: O(T)
+
+
+# Optimal Solution
 class Solution:
     def mergeAlternately(self, word1: str, word2: str) -> str:
         A, B = len(word1), len(word2)
@@ -24,5 +59,9 @@ def mergeAlternately(self, word1: str, word2: str) -> str:
             b += 1
 
         return ''.join(s)
-        # Time: O(A + B) - A is Length of word1, B is Length of word2
-        # Space: O(A + B) - A is Length of word1, B is Length of word2
+        # Let A be the length of Word1
+        # Let B be the length of Word2
+        # Let T = A + B
+        
+        # Time: O(T)
+        # Space: O(T)