题解 | #合并两个有序的数组#

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