leetcode(9)-----Merge Sorted Array

合并两个有序数组
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

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

Example:

Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6],       n = 3

Output: [1,2,2,3,5,6]

---

Python代码实现：

1.不使用额外空间直接在替换

while m>0 and n >0:
            if nums1[m-1] >= nums2[n-1]:
                nums1[m+n-1] = nums1[m-1]
                m = m -1
            else :
                nums1[m+n-1] = nums2[n-1]
                n = n-1
        if n > 0 :
            nums1[:n] = nums2[:n]

2.使用额外空间保存一下原来的列表，再替换原列表中的元素

class Solution:
    def merge(self, nums1, m, nums2, n):
        nums = nums1[:]
        i = 0 
        j = 0
        k = 0
        while i<m and j<n:
            if nums[i]<=nums2[j]:
                nums1[k] = nums[i]
                i = i+1
            else:
                nums1[k] = nums2[j]
                j = j+1
            k = k+1
        if j<n:
            while j<n:
                nums1[k] = nums2[j]
                j = j+1
                k = k+1
        else:
            while i<m:
                nums1[k] = nums[i]
                i= i+1
                k = k+1