88.md

88. Merger 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.

my thoughts:

1. a little hard to understand. had to take a peek at some other ppl's solution to really understand what it is asking for. I guess part of the confusion is caused by the python list/array mix-up. Anyway, for Java array, this is just a reverse sort, where the largest numbers are placed in first as the first part of nums1 need to be in place till sorted.

my solution:

**********39ms
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.
        """
        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]

my comments:

from other ppl's solution:

1. N/A