Merge Sorted Array

最新推荐文章于 2024-08-08 22:57:04 发布

zjj2015

最新推荐文章于 2024-08-08 22:57:04 发布

阅读量226

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/zjj2015/article/details/49980715

算法专栏收录该内容

131 篇文章

订阅专栏

本文介绍了一种将两个已排序的整数数组A和B合并为一个排序数组A的算法实现。该算法通过比较两个数组的末尾元素并从后向前填充结果来完成合并，确保了空间复杂度为O(1)。当其中一个数组被完全合并后，如果另一个数组还有剩余，则直接将其余元素追加到结果数组中。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Example
A = [1, 2, 3, empty, empty], B = [4, 5]

After merge, A will be filled as [1, 2, 3, 4, 5]

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 n respectively.

class Solution {
    /**
     * @param A: sorted integer array A which has m elements, 
     *           but size of A is m+n
     * @param B: sorted integer array B which has n elements
     * @return: void
     */
     public void mergeSortedArray(int[] A, int m, int[] B, int n) {
        if (A == null || B == null) return;

        int index = m + n - 1;
        while (m > 0 && n > 0) {
            if (A[m - 1] > B[n - 1]) {
                A[index] = A[m - 1];
                m--;
            } else {
                A[index] = B[n - 1];
                n--;
            }
            index--;
        }

        // B has elements left
        while (n > 0) {
            A[index] = B[n - 1];
            n--;
            index--;
        }
    }
}