题目描述
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 to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.
把两个有序数组并在一起,B并入A。
方法是:从后往前遍历,把选出的大数放在最后的位置,依次往前。当A中的数全部放置完成,在把B中的数放进A中。
public void merge(int A[], int m, int B[], int n) {
if(m == 0){
for(int i=0; i<n; i++)
A[i] = B[i];
}else{
int j=m-1;
int k=n-1;
int s = m+n-1;
while(j>=0 && k>=0){
if(A[j] > B[k])
A[s--] = A[j--];
else
A[s--] = B[k--];
}
if(j == -1)
for(; k>=0; k--){
A[k]=B[k];
}
}
}
这个题目理应熟记,我相信会考到的。