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

import java.util.*;
public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        int rightA = A.length - 1 - n;
        int rightB = B.length - 1;
        int right = A.length - 1;

        while (rightA >= 0 && rightB >= 0) {
            if (A[rightA] > B[rightB]) {
                A[right--] = A[rightA--];
            } else {
                A[right--] = B[rightB--];
            }
        }
        while (rightA >= 0) {
            A[right--] = A[rightA--];
        }
        while (rightB >= 0) {
            A[right--] = B[rightB--];
        }
    }
}