Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
- The number of elements initialized in nums1 and nums2 are m and n respectively.
- You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
解法一:先合并,在排序,但并没有用到有序这个条件
public static int[] merge(int[] nums1, int m, int[] nums2, int n) {
for(int i=0; i<n; i++){
nums1[m+i] = nums2[i];
}
for(int i = m+n-1; i>= 0; i--){
for(int j = i; j>=0; j--){
if(nums1[i] < nums1[j]){
int temp = nums1[i];
nums1[i] = nums1[j];
nums1[j] = temp;
}
}
}
return nums1;
解法二:
public static int[] merge_2(int[] nums1, int m, int[] nums2, int n) {
int len = m+n;
int p1 = m-1;
int p2 = n-1;
for(int i = len-1; i>=0; i--){
if(p1 == -1){//nusm1元素遍历完了,nums2全放进去
nums1[i] = nums2[p2];
p2--;
}
else if(p2 ==-1){
nums1[i] = nums1[p1];
p1--;
}
else if(nums1[p1] >= nums2[p2]){
nums1[i] = nums1[p1];
p1--;
}
else{
nums1[i] = nums2[p2];
p2--;
}
}
return nums1;
}