Given two sorted integer arrays
nums1
and
nums2
, merge
nums2
into
nums1
as one sorted array.
Note:
You may assume that
nums1 has enough space (size that is greater or equal to
m +
n) to hold additional elements from
nums2. The number of elements initialized in
nums1 and
nums2 are
m and
n respectively.
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int[] temp = new int[m+n];
int i,j,x=0;
for(i=0,j=0;i<m&&j<n;){
if(nums1[i]<nums2[j]){
temp[x++]=nums1[i++];
}else
temp[x++]=nums2[j++];
}
if(i>=m){
for(;j<n;j++){
temp[x++]=nums2[j];
}
}else if(j>=n){
for(;i<m;i++)
temp[x++]=nums1[i];
}
for(int t=0;t<m+n;t++){
nums1[t]=temp[t];
}
}
}
好思路:在nums1中倒序存储。
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int i=m-1,j=n-1,x=m+n-1;
while(x>=0){
if (i < 0) {
nums1[x--] = nums2[j--];
continue;
}
if(j<0)
break;
if(nums1[i]<nums2[j]){
nums1[x--]=nums2[j--];
}else{
nums1[x--]=nums1[i--];
}
}
}
}