public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        int i = m - 1;
        int j = n - 1;
        int k = m + n - 1;

        while (k >= 0) {
            if (j < 0) break;
            if (i >= 0 && A[i] > B[j]) A[k--] = A[i--];
            else A[k--] = B[j--];
        }
    }
    public static void main(String[] args) {

    }
}