88. Merge Sorted Array python

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 nrespectively.
• 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

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: None Do not return anything, modify nums1 in-place instead.
        """
        i=m-1
        j=n-1
        end=i+n
        while(i>=0 and j>=0):
            if(nums2[j]>=nums1[i]):
                nums1[end]=nums2[j]
                j-=1
                end-=1
            else:
                nums1[end]=nums1[i]
                i-=1
                end-=1
        
        if(i==-1):
            while(j>=0):
                nums1[end]=nums2[j]
                j-=1
                end-=1
       
                
                
                

nums2 = [2,5,6],       n = 3

Output: [1,2,2,3,5,6]

题意：给两个有序list，把nums2并到nums1中，nums1足够大

解法：从最后一个开始比较