(每日算法)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.

按照归并排序的惯性思路，因为归并排序中给定的是一个数组的两个区间，所以通常情况下会借助O(n)大小的辅助空间。思路如下：

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

但是上述题目给定的条件更加灵活，因此可以采用尾插法，这样就不再需要辅助空间的开销，理解上也更加简洁：

class Solution {public:    void merge(int A[], int m, int B[], int n) {        int ia = m - 1, ib = n - 1, icur = m + n - 1;        while(ia >= 0 && ib >= 0)            A[icur--] = A[ia] > B[ib] ? A[ia--] : B[ib--];        while(ib >=0)            A[icur--] = B[ib--];    }};