题目:
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.
依次遍历A和B,取小的值放入新数组。最后把新数组复制给A。
最后复制步骤有个坑,不能用A=temp,不然,当A为空时会出错!
代码:
public class Solution {
public void merge(int A[], int m, int B[], int n) {
int[] temp = new int[m+n];
int i=0,j=0,k=0;
for(;i<m && j<n;k++){
if(A[i] <= B[j]){
temp[k] = A[i];
i++;
} else {
temp[k] = B[j];
j++;
}
}
for(;i<m;i++){
temp[k] = A[i];
k++;
}
for(;j<n;j++){
temp[k] = B[j];
k++;
}
for(i=0;i<m+n;i++){
A[i] = temp[i];
}
}
}