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 and n respectively.
给出两个有序数组A和B,将他们合成一个有序数组A。
Note:假设A有足够的空间(大小大于或者等于m+n)去存储B的元素。A和B的元素各自初始化为m个和n个。
由于A的后n个空间是没有元素的,所以我们可以倒着排,这样时间复杂度就只有O(m+n)了。
代码很简单:
class Solution {
public:
void merge(int A[], int m, int B[], int n) {
if(n<1) return;
int k=m+n-1;
int i=m-1;
int j=n-1;
while( i>=0 && j>=0 )
{
A[k--]=A[i]>B[j]?A[i--]:B[j--];
}
while(j>=0) A[k--]=B[j--];
}
};