leetcode -- Merge Sorted Array

过去已无法改变，未来又难以琢磨，我们只能把握当下

[问题描述]

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 (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m andn respectively.

[解题思路]

void Solution::merge(int A[], int m, int B[], int n)
{
    int p = m + n;
    while(p){
        if (n == 0)
            A[p-- - 1] = A[m-- - 1];
        else if (m == 0)
            A[p-- - 1] = B[n-- - 1];
        else
            A[p-- - 1] = A[m - 1] > B[n - 1]?(A[m-- -1]):(B[n-- -1]);
    }
}