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.
这种题放在两年前研究生复试的时候都能一次AC的……真是不知道怎么了,老是没有刷题的感觉,是因为事情太多了吗?
class Solution {
public:
void merge(int A[], int m, int B[], int n) {
int i,j,k;
k=m+n-1;
i=m-1;j=n-1;
while(i>=0&&j>=0)
{
if(A[i]>B[j])
{
A[k]=A[i];
k--;i--;
}
else
{
A[k]=B[j];
--k;--j;
}
}
while(0 <= i)
{
A[k--] = A[i--];
}
while(0 <= j)
{
A[k--] = B[j--];
}
}
};