遍历完第一个while loop,如果m仍大于0,不需要继续遍历,nums1剩下的部分已经有序了。
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: None 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]
def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
"""
Do not return anything, modify nums1 in-place instead.
"""
m -= 1
n -= 1
i = len(nums1)-1
while m>=0 and n>=0:
if nums1[m] > nums2[n]:
nums1[i] = nums1[m]
m -= 1
else:
nums1[i] = nums2[n]
n -= 1
i -= 1
while n>=0:
nums1[i] = nums2[n]
n -= 1
i -= 1