Merge Sorted Array

最新推荐文章于 2022-03-29 18:08:48 发布

cgdong2014

最新推荐文章于 2022-03-29 18:08:48 发布

阅读量219

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/cgdong2014/article/details/40134105

版权

LeetCode 专栏收录该内容

139 篇文章 0 订阅

订阅专栏

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.

思路： Find the last element index. From the rear to front of A to copy the bigger elements. At last we need to check B array still has some elements left.

易错点：最后可能A 到头了但是 B 没到头。

public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        int index = m + n - 1;
        m--;
        n--;
        while(m >= 0 && n >= 0){
            if(A[m] > B[n]){
                A[index] = A[m];
                m--;
            }else{
                A[index] = B[n];
                n--;
            }
            index--;
        }
        while(n>= 0 ){
            A[index] = B[n];
            n--;
            index--;
        }
    }
}