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.
        """
        i = 0
        j = 0
        k = 0
        while(i < m + n and j < n):
            while(i < m + k and nums1[i] < nums2[j]): #先尋找比nums數組中所有的數都小的數，然後插入進去
                i += 1
            if i == m + k: # 說明剩余的數都比原來的nums1大，直接替換就行了。
                break;
            nums1.insert(i,nums2[j])
            del(nums1[-1])
            k += 1
            j += 1
        while(j < n):
            nums1[i] = nums2[j]
            i += 1
            j += 1
 

Leetcode:Merge Sorted Array