【leetcode】(python)88. Merge Sorted Array合并排序数组

88. Merge Sorted Array Easy

Description

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]

题意

将两个排序数组合并成一个排序数组。

解题思路

这题与其他的合并数组的不同之处在于nums1的数组排序后预留了nums的长度位置，且接在num1的值后面全为0，那么直接将nums2的值覆盖到num1为0的位置上然后直接排序即可，同时也要注意n=0的情况。

code

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.
        """
        if m > 0 and n == 0:
            nums1 = nums1
        for i,num in enumerate(nums2):
            nums1[-(i+1)] = num
        nums1 = nums1.sort()