一、leetcode地址
https://leetcode.com/problems/merge-sorted-array/
二、问题描述
三、代码实现
语言:Python3
代码:
class Solution:
def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
"""
Do not return anything, modify nums1 in-place instead.
"""
k = 0
print(m,n)
for num in nums2:
while num > nums1[k]:
if k < m-1:
k += 1
else:
nums1.insert(m,num)
m += 1
nums1.pop()
break
else:
nums1.insert(k,num)
m += 1
nums1.pop()
k += 1