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]
设置三个指针,i 为 nums1的末尾元素, j 为nums2的末尾元素, k 为总长度的末尾元素。
从后向前比较,将大的元素放置到nums1[k] 上,k - - ,i/j - -
最后判断一下是否nums2中还有元素,直接将nums2的剩余元素放置过去即可。
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int i = m - 1;
int j = n - 1;
int k = m + n - 1;
while (i >= 0 && j >= 0) {
if (nums1[i] > nums2[j]) {
nums1[k] = nums1[i];
k--;
i--;
} else {
nums1[k] = nums2[j];
k--;
j--;
}
}
while (j >= 0) {
nums1[k] = nums2[j];
k--;
j--;
}
}
}