[leetcode][88] Merge Sorted Array

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.

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: void Do not return anything, modify nums1 in-place instead.
        """
        point1 = m-1
        point2 = n-1
        k = m+n-1
        while point1 >=0 and point2 >=0:
            if nums1[point1] < nums2[point2]:
                nums1[k] = nums2[point2]
                point2 -= 1
            else:
                nums1[k] = nums1[point1]
                point1 -= 1
            k -= 1
        while point2 >= 0:
            nums1[k] = nums2[point2]
            point2 -= 1
            k -= 1
        while point1 >= 0:
            nums1[k] = nums1[point1]
            k -= 1
            point1 -=1
        return None