Merge Sorted Array

从后向前遍历

public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int indexA = m - 1;
        int indexB = n - 1;
        int k = m + n - 1;
        while(indexA >= 0 && indexB >= 0)
        {
            if(A[indexA] >= B[indexB])
            {
                A[k] = A[indexA];
                indexA--;
            }
            else
            {
                A[k] = B[indexB];
                indexB--;
            }
            k--;
        }
        while(indexB >= 0)
        {
            A[k] = B[indexB];
            indexB--;
            k--;
        }
    }
}