algorithm004-01 · melody-li · Oct 21, 2019 · Oct 21, 2019 · Oct 21, 2019 · Oct 21, 2019
diff --git a/Week 01/id_226/leetCode_226.py b/Week 01/id_226/leetCode_226.py
@@ -0,0 +1,15 @@
+class Solution(object):
+    def moveZeroes(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: None Do not return anything, modify nums in-place instead.
+        """
+        snowBall = 0
+        index = 0
+        while index < len(nums):
+            if nums[index] == 0:
+                snowBall += 1
+            elif snowBall > 0:
+                nums[index] , nums[index - snowBall] = nums[index - snowBall],nums[index]
+            index += 1
+
diff --git a/Week 01/id_226/leetCode_88_226.py b/Week 01/id_226/leetCode_88_226.py
@@ -0,0 +1,24 @@
+class Solution(object):
+    def merge(self, nums1, m, nums2, n):
+        """
+        :type nums1: List[int]
+        :type m: int
+        :type nums2: List[int]
+        :type n: int
+        :rtype: None Do not return anything, modify nums1 in-place instead.
+        """
+        if m == 0:
+            nums1[:] = nums2
+        tail1 = m - 1
+        tail2 = n - 1
+        tail = m + n -1 
+        while tail1 >= 0 and tail2 >=0:
+            if nums1[tail1] < nums2[tail2]:
+                nums1[tail] = nums2[tail2]
+                tail2 -= 1
+            else:
+                nums1[tail] = nums1[tail1]
+                tail1 -= 1
+            tail -= 1
+        if tail2 >= 0:
+            nums1[:tail2 + 1] = nums2[:tail2 + 1]