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

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