首页 > 代码库 > merge-sorted-array

merge-sorted-array

2024-09-07 12:47:16   218人阅读

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--];  
        }         
    }
};

 

merge-sorted-array


联系
我们