Lintcode 合并排序数组 II

[1, 2, 3, empty, empty]

[4, 5]

[1,2,3,4,5]

class Solution {
public:
/**
* @param A: sorted integer array A which has m elements,
*           but size of A is m+n
* @param B: sorted integer array B which has n elements
* @return: void
*/
void mergeSortedArray(int A[], int m, int B[], int n) {
// write your code here
while(n){
if(m==0){
for(int i=0;i<n;i++){
A[i]=B[i];
}
break;
}

if(B[n-1]>=A[m-1]){
A[m+n-1]=B[n-1];
n--;
}
else{
A[n+m-1]=A[m-1];
m--;
}
}
}
};