leetcode合并有序数组

Question

我在https://leetcode.com/problems/merge-sorted-array/description/中看到了这个，答案在https://leetcode.com/problems/merge-sorted-array/discuss/29503/Beautiful-Python-解决方案

def merge(self, nums1, m, nums2, n):
        while m > 0 and n > 0:
            if nums1[m-1] >= nums2[n-1]:
                nums1[m+n-1] = nums1[m-1]
                m -= 1
            else:
                nums1[m+n-1] = nums2[n-1]
                n -= 1
        if n > 0:
            nums1[:n] = nums2[:n]

我有两个疑惑：

1. 当我想运行代码print(Solution().merge([1, 2, 3], 3, [4, 5, 6], 3))时，它只是给了我一个错误提示IndexError: list assignment index out of range 。
2. 我不太了解上面答案中的方法。 有人能告诉我如何解决这类问题吗？

Answer 1

问题在这里：

def merge(self, nums1, m, nums2, n):
    while m > 0 and n > 0:
        if nums1[m-1] >= nums2[n-1]:
            nums1[m+n-1] = nums1[m-1]   # nums1[m+n-1] IndexError
            m -= 1
        else:
            nums1[m+n-1] = nums2[n-1]   # Same as above
            n -= 1
    if n > 0:
        nums1[:n] = nums2[:n]

您可能想先“调整”列表的大小以防止索引错误：

def merge(self, nums1, m, nums2, n):
    nums1 += nums2
    # Or nums1 += [None] * len(nums2)

    while m > 0 and n > 0:
        if nums1[m-1] >= nums2[n-1]:
            nums1[m+n-1] = nums1[m-1] # nums1[m+n-1] IndexError
            m -= 1
        else:
            nums1[m+n-1] = nums2[n-1] # Same as above
            n -= 1
    if n > 0:
        nums1[:n] = nums2[:n]

Answer 2

def merge_two_sorted_arrays(left: list, right: list) -> list:
    """
    Merge Sorted Array in leetcode
    Args:
        left: left array
        right: right array

    Returns: A new merged array
    """
    A = [None] * (len(left) + len(right))
    i = j = k = 0
    while i < len(left) and j < len(right):
        if left[i] < right[j]:
            A[k] = left[i]
            i += 1
        else:
            A[k] = right[j]
            j += 1
        k += 1
    while i < len(left):
        A[k] = left[i]
        i += 1
        k += 1
    while j < len(right):
        A[k] = right[j]
        j += 1
        k += 1

    return A


a = [1, 2, 2, 4]
b = [3, 5, 6, 9]

print(merge_two_sorted_arrays(a, b))

输出：

[1, 2, 2, 3, 4, 5, 6, 9]

Answer 3

class Solution: def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None: nums1[m:] = nums2 nums1.sort()