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

双指针

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