LeetCode-88. Merge Sorted Array(python)

前言

思路是：从后往前一个一个对比，大的数放在后面。因为nums1的长度是够长的。循环的判断条件是n，因为当nums1先对比完的话，n还不为0; 当nums2先对比完的话，nums1就不用对比了。

1. 题目

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]

2. 代码

class Solution:
    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
        while n:
            if m and nums1[m-1]>=nums2[n-1]:
                nums1[n+m-1] = nums1[m-1]
                m-=1
            else nums1[n+m-1] = nums2[n-1]
                n -= 1