题目:
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
- The number of elements initialized in nums1 and nums2 are m and n respectively.
- You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
Example:
Input: nums1 = [1,2,3,0,0,0], m = 3 nums2 = [2,5,6], n = 3 Output: [1,2,2,3,5,6]
def merge(self, nums1, m, nums2, n):
for i in range(len(nums1)-m):
nums1.pop()
i = j = 0
while i < m and j < n:
if nums2[j] < nums1[i]:
nums1.insert(i,nums2[j])
m += 1
j += 1
i += 1
if i == m:
while j < n:
nums1.insert(i,nums2[j])
i += 1
j += 1
//脑子简单,就是先把nums1多的元素pop掉,然后将nums2与nums1比较,然后插入
参考:
nums1[m:] = nums2[:n]nums1.sort()
--------------新手刷题,仅用于自身记录,如有错误,欢迎指出---------------