class Solution {
public:
void merge(int A[], int m, int B[], int n) {
int length = m+n;
int Ai = m-1;
int Bi = n-1;
for(int i=length-1 ;i>=0;i--){
if(Ai >=0 && Bi>=0){
if(A[Ai] >= B[Bi]){
A[i] = A[Ai];
Ai--;
continue;
}
else{
A[i] = B[Bi];
Bi--;
continue;
}
}
if(Ai < 0 && Bi >=0)
A[i] = B[Bi--];
if(Bi < 0 && Ai >=0)
A[i] = A[Ai--];
}
}
};
Merge Sorted Array
最新推荐文章于 2014-11-13 14:15:32 发布