problem:
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.
Solution:
方法一:按照归并排序的思路,借助O(n)大小的辅助空间。
代码如下:
public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int[] nums = new int[m+n];
int i=0;
int k=0;
int j=0;
while(i<m && j<n){
if(nums1[i]<nums2[j])
nums[k++]=nums1[i++];
else
nums[k++] =nums2[j++];
}
while(i<m)
nums[k++]=nums1[i++];
while(j<n)
nums[k++] = nums2[j++];
while(--k>=0)
nums1[k] = nums[k];
}
}
方法二:采用尾插法,这样就不再需要辅助空间的开销。
代码如下:
public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int ia=m-1,ib=n-1,cur = m+n-1;
while(ia>=0 && ib>=0)
nums1[cur--] = nums1[ia]>nums2[ib]?nums1[ia--]:nums2[ib--];
while(ib>=0)
nums1[cur--] = nums2[ib--];
}