Merge Sorted Araay

CodingProgrammer · CodingProgrammer · commit 370de5db1b5e · 2017-12-15T21:56:28.000+08:00
diff --git a/088_ Merge Sorted Array.py b/088_ Merge Sorted Array.py
@@ -0,0 +1,18 @@
+class Solution:
+    def merge(self, nums1, m, nums2, n):
+        """
+        :type nums1: List[int]
+        :type m: int
+        :type nums2: List[int]
+        :type n: int
+        :rtype: void Do not return anything, modify nums1 in-place instead.
+       """
+        while m > 0 and n > 0:
+            if nums1[m - 1] > nums2[n - 1]:
+                nums1[m + n - 1] = nums1[m - 1]
+                m -= 1
+            else:
+                nums1[m + n - 1] = nums2[n - 1]
+                n -= 1
+        if n > 0:
+            nums1[:n] = nums2[:n]
