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