[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 mand n respectively.

思路：从结尾开始复制

代码：

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