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.
Example:
Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]
思路:从左往右,正向merge,会出现覆盖的问题,比如nums2的值全部小于num1,那么当2进入到1的时候,1的值怎么保存呢?
所以,想着从右往左,最大开始merge,因为nums1的屁股后面是0,可以利用的。最后还要考虑,nums2里面还有东西没有copy的情况。
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int lastIndex1 = m - 1;
int lastIndex2 = n - 1;
int j = nums1.length - 1;
while(lastIndex1 >= 0 && lastIndex2 >= 0) {
if(nums1[lastIndex1] > nums2[lastIndex2]) {
nums1[j--] = nums1[lastIndex1--];
} else {
nums1[j--] = nums2[lastIndex2--];
}
}
while(lastIndex1 >= 0) {
nums1[j--] = nums1[lastIndex1--];
}
while(lastIndex2 >= 0) {
nums1[j--] = nums2[lastIndex2--];
}
}
}