问题描述:
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.
思路一:
从前往后搜索。针对nums2中的每个值,如nums2[0],将其与nums1中的每个值进行比较,若小,则放入nums1中,然后将较大值放入nums2[0]。将nums1遍历完后,将nums2[0]的值放入nums1的尾部。如此循环。
代码一:
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
for(int index2 = 0; index2 < n; index2++){
int index1 = 0;
while(index1 < m){
if(nums1[index1] <= nums2[index2])
index1++;
else{
int temp = nums1[index1];
nums1[index1] = nums2[index2];
nums2[index2] = temp;
index1++;
}
}
nums1[m] = nums2[index2];
m = m + 1;
}
return;
}
}
思路二:
从前向后搜索需要移动所有的元素,可以考虑从后向前进行搜索,因为数组的总长度是固定的。
代码二:
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int index1 = m - 1;
int index2 = n - 1;
int len = m + n - 1;
while(index1 >= 0 && index2 >= 0){
if(nums1[index1] > nums2[index2]){
nums1[len] = nums1[index1];
index1--;
}
else{
nums1[len] = nums2[index2];
index2--;
}
len--;
}
while(index2 >= 0){
nums1[len] = nums2[index2];
len--;
index2--;
//简单可以写作:nums1[len--] = nums2[index2--];
}
return;
}
}