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.
要从后往前拷才能保证A内原来的内容不被覆盖。有很多数组拷贝问题都是从后往前拷贝。
class Solution {
public:
void merge(int A[], int m, int B[], int n) {
if (!A || !B) return;
int j = m + n - 1;
while (n)
{
if (m > 0 && A[m-1] > B[n-1])
A[j--] = A[--m];
else
A[j--] = B[--n];
}
}
};