leetcode-easy-listnode-88 Merge Sorted Array-NO

mycode

不会。。。。。。。。。。。

参考

思路:从后往前计算，这样不会覆盖nums1中的有效值

由于

• You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.所以相当于自己去控制最大下标就是m-1+n

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.
        """
        while m > 0 and n > 0:
            if nums1[m-1] < nums2[n-1]:
                nums1[m-1+n] = nums2[n-1]
                n = n - 1
            else:
                nums1[m-1+n] = nums1[m-1]
                m = m - 1
        if m == 0 and n> 0:
            nums1[:n] = nums2[:n]