Problem Description:
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]
Analysis:
这个题目的思路比较直接,将第一个数组整体向后移动n个单位,然后在同时遍历两个数组比较然后插入到第一个数组中。代码如下:
Code:
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
for(int k = m + n - 1; k >= n; k--) {
nums1[k] = nums1[k - n];
}
int i = n;
int j = 0;
int index = 0;
while(i < m + n || j < n) {
if(j >= n) {
break;
}
if(i >= m + n) {
for(int k = j; k < n; k++) {
nums1[index++] = nums2[k];
}
break;
}
if(nums1[i] < nums2[j]) {
nums1[index++] = nums1[i];
i++;
} else {
nums1[index++] = nums2[j];
j++;
}
}
}
}