merge-sorted-array

最新推荐文章于 2022-05-02 07:58:29 发布

weixin_34204722

最新推荐文章于 2022-05-02 07:58:29 发布

阅读量38

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/xiuxiu55/p/6518799.html

本文介绍了一种将两个已排序的整数数组B合并到数组A中的方法，使其成为一个有序数组。通过双指针从后向前比较两个数组的元素并进行合并操作。此算法确保了合并后的数组仍然保持有序。

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 to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        
        if(A==NULL || B==NULL)  
            return; 
        
        int idx1 = m-1;  
        int idx2 = n-1;  
        int len = m+n-1;  
        
        while(idx1>=0 && idx2>=0)  
        {  
            if(A[idx1]>B[idx2])  
            {  
                A[len--] = A[idx1--];  
            }  
            else  
            {  
                A[len--] = B[idx2--];  
            }  
        }  
        while(idx2>=0)  
        {  
             A[len--] = B[idx2--];  
        }         
    }
};