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.
思路:
其实没太理解这个题目的意思,为什么直接将两个列表相加然后再sort()不行。先mark一个揭发学习一下。
参考代码:
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.
"""
m, n = m-1, n-1
while m >= 0 and n >= 0:
if nums1[m] > nums2[n]:
nums1[m+n+1] = nums1[m]
m -= 1
else:
nums1[m+n+1] = nums2[n]
n -= 1
if n != -1: # nums2 is still left
nums1[:n+1] = nums2[:n+1]