Merge Sorted Array Leetcode Python

最新推荐文章于 2025-11-25 00:06:26 发布

原创最新推荐文章于 2025-11-25 00:06:26 发布 · 533 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #python #链表

leetcode 专栏收录该内容

166 篇文章

订阅专栏

本文介绍了一种将两个已排序的整数数组合并成一个有序数组的方法。通过使用额外的临时数组来存储合并后的元素，实现了时间复杂度为O(m+n)、空间复杂度也为O(m+n)的解决方案。

Given two sorted integer arrays A and B, merge B into A as one sorted array.

Note:

You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m and nrespectively.

时间复杂度O(m+n) 空间复杂度 O(m+n) 还有更优的方法暂时还没做出来。

做法是新建一个数组tmp 归并的方法比较A和B里面值的大小，全部存到tmp里面。最后再存回A。

The time complexity and space complexity are both O(m+n). we use a new array tmp to store the value of A and B by order and then put it back to A. This problem can be treated as part of merge sort. The are some better methods, if you guys have it please leave it here.

class Solution:
    # @param A  a list of integers
    # @param m  an integer, length of A
    # @param B  a list of integers
    # @param n  an integer, length of B
    # @return nothing
    def merge(self, A, m, B, n):
        tmp=[0 for index in range(m+n)]
        i=0
        j=0
        k=0
        while i<m and j<n:
            if A[i]<B[j]:
                tmp[k]=A[i]
                i+=1
            else:
                tmp[k]=B[j]
                j+=1
            k+=1
        while i<m:
            tmp[k]=A[i]
            i+=1
            k+=1
        while j<n:
            tmp[k]=B[j]
            j+=1
            k+=1
            
        for index in range(m+n):
            A[index]=tmp[index]
        return A