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: void Do not return anything, modify nums1 in-place instead.
"""
nums=nums1[:m]
nums.extend(nums2[:n])
nums.sort()
for i in range(m+n):
nums1[i]=nums[i]
LeetCode-88-Merge Sorted Array
最新推荐文章于 2022-01-27 01:09:41 发布