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]
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/merge-sorted-array
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

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.
        """
        l = m + n
        while m > 0 and n > 0:
            if nums1[m-1] > nums2[n-1]:
                nums1[l-1] =  nums1[m-1]
                m -= 1
            else:
                nums1[l-1] = nums2[n-1]
                n -= 1
            l -= 1
        if n > 0:
            for i in range(n):
                nums1[i] = nums2[i]
        print(nums1)
        return nums1
"""
[1,2,3,0,0,0]
3
[2,5,6]
3
[1,2,0,0,0]
2
[2,5,6]
3
[2,5,6,0,0,0]
3
[1,2,3]
3
[2,5,6,0,0,0]
3
[5,7]
2
"""