[Leetcode 88, Easy] Merge Sorted Array

最新推荐文章于 2021-10-30 05:34:00 发布

原创最新推荐文章于 2021-10-30 05:34:00 发布 · 412 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode_easy 专栏收录该内容

58 篇文章

订阅专栏

本文详细解析了如何使用C++和Java合并两个已排序数组为一个有序数组的过程，采用三个指针策略进行操作，确保算法高效且易于理解。

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

Problem:

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.

Analysis: This is a typical problem that operates more than 1 pointer (3 pointers).

Solutions:

C++:

void merge(int A[], int m, int B[], int n) {
        int cur = m + n - 1;
        int indexA = m - 1; 
        int indexB = n - 1;
        while(indexA >= 0 && indexB >= 0) {
            if(A[indexA] > B[indexB])
                A[cur--] = A[indexA--];
            else
                A[cur--] = B[indexB--];
        }
        
        if(indexA >= 0)
            while(indexA >= 0)
                A[cur--] = A[indexA--];
        else if(indexB >= 0)
            while(indexB >= 0)
                A[cur--] = B[indexB--];
        
    }

Java:

Python: