public class Solution {
public void merge(int A[], int m, int B[], int n) {
if(B==null || B.length < 1) return;
int len = m+n-1;
int i = m-1, j = n-1;
while(len >= 0) {
if(i < 0) {
A[len--] = B[j--];
} else if (j < 0) {
A[len--] = A[i--];
} else if(A[i] > B[j]) {
A[len--] = A[i--];
} else {
A[len--] = B[j--];
}
}
}
}