Total Accepted: 96339
Total Submissions: 321421
Difficulty: Easy
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 nums1and nums2 are m and n respectively.
方法一:浪费空间
public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int[] numMerge = new int[m + n];
int index1 = 0 , index2 = 0, indexM = 0;
while(index1 < m && index2 < n){
if(nums1[index1] <= nums2[index2]){
numMerge[indexM++] = nums1[index1++];
}
if(nums1[index1] > nums2[index2]){
numMerge[indexM++] = nums2[index2++];
}
}
while(index1 < m){
numMerge[indexM++] = nums1[index1++];
}
while(index2 < n){
numMerge[indexM++] = nums2[index2++];
}
for(int i = 0; i < (m + n); i ++)
nums1[i] = numMerge[i];
}
}
方法二:节省空间
public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int index1 = m - 1;
int index2 = n - 1;
int indexM = m + n - 1;
while(indexM >= 0){
if( (index2 < 0) || (index1 >= 0 && nums1[index1] >= nums2[index2]))
nums1[indexM--] = nums1[index1--];
else nums1[indexM--] = nums2[index2--];
}
}
}