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

 

 1 class Solution(object):
 2     def merge(self, nums1, m, nums2, n):
 3         """
 4         :type nums1: List[int]
 5         :type m: int
 6         :type nums2: List[int]
 7         :type n: int
 8         :rtype: void Do not return anything, modify nums1 in-place instead.
 9         """
10         while m > 0 and n > 0:
11             if nums1[m-1] >= nums2[n-1]:
12                 nums1[m+n-1] = nums1[m-1]
13                 m -= 1
14             else:
15                 nums1[m+n-1] = nums2[n-1]
16                 n -= 1
17         if n > 0:
18             nums1[:n] = nums2[:n]

 

转载于:https://www.cnblogs.com/fullest-life/p/6554428.html