leetcode Merge Sorted Array

从后往前比较大小

代码

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