题目:
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]
题解:
这道题是不能借助一个新的array的,那么我们就不好从前往后比了(不好插入位置)。方便的方法是从后往前比,然后最后处理剩下的元素。
代码如下:
import java.util.Arrays;
public class MergeSortedArray {
public static void main(String[] args) {
/**
* 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]
*/
int[] nums1 = new int[] { 1, 2, 3, 0, 0, 0 };
int[] nums2 = new int[] { 2, 5, 6 };
merge(nums1, 3, nums2, 3);
System.out.println(Arrays.toString(nums1));
}
public static void merge(int[] nums1, int m, int[] nums2, int n) {
while (m > 0 && n > 0) {
if (nums1[m - 1] > nums2[n - 1]) {
nums1[m + n - 1] = nums1[--m];
} else {
nums1[m + n - 1] = nums2[--n];
}
}
while (n > 0) {
nums1[n - 1] = nums2[--n];
}
}
}