LeetCode--088--合并两个有序数组

方法1：

 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]

同上:

 class Solution:
     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.
         """
         end = m + n -1
         m -= 1
         n -= 1
         while end >= 0 and m >= 0 and n >= 0:
             if nums1[m] > nums2[n]:
                 nums1[end] = nums1[m]
                 m -= 1
             else:
                 nums1[end] = nums2[n]
                 n -= 1
             end -= 1
         while n >= 0:
             nums1[end] = nums2[n]
             n -= 1
             end -= 1

方法3：

 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.
         """
         nums1[m: m + n] = nums2[: n]
         nums1.sort()