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.

Solution

• From the end to front, Add the larger

1
2
3
4
5
6
7
8
9

class Solution:
    #@param A: sorted integer array A which has m elements, 
    #          but size of A is m+n
    #@param B: sorted integer array B which has n elements
    #@return: void
    def mergeSortedArray(self, A, m, B, n):
        for i in range(n):
            A[i+m] = B[i]
        A.sort()