6.1 Merge Sorted Array

Notes:
	Given two sorted integer arrays A and B, merge B into A as one sorted array.
	Note:
	You may assume that A has enough space to hold additional elements from B.
	The number of elements initialized in A and B are m and n respectively.
	Solution: From back to forth.
	*/

归并排序升级版

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