NC22 合并两个有序的数组

解题思路：双指针倒序合并

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