[Lintcode]Merge Sorted Array

Given two sorted integer arrays A and B, merge B into A as one sorted array.

Example

A = [1, 2, 3, empty, empty], B = [4, 5]

After merge, A will be filled as [1, 2, 3, 4, 5]

如果从数组A的index=0替换，那么涉及到插入新元素的问题。为了避免这种问题，可以考虑从数组A的末位开始插入。

class Solution {
    /**
     * @param A: sorted integer array A which has m elements, 
     *           but size of A is m+n
     * @param B: sorted integer array B which has n elements
     * @return: void
     */
    public void mergeSortedArray(int[] A, int m, int[] B, int n) {
        
        while(m > 0 && n > 0) {
            if(A[m - 1] > B[n - 1]) {
                A[m + n - 1] = A[m - 1];
                m--;
            }
            else {
                A[m + n - 1] = B[n - 1];
                n--;
            }
        }
        
        while(n > 0) {
            A[m + n - 1] = B[n - 1];
            n--;
        }
    }
}