88. Merge Sorted Array
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.
题目翻译:
给定两个有序整数数组A和B,把B并入A成为一个有序数组。
注意:
可以假设A有足够的空间(大小大于等于m + n)来保存来自B的额外元素。A和B的初始元素个数分别为m和n。
从后向前考虑。如果A中的先遍历完,应把B中剩下的元素复制到A中。
public void merge(int[] nums1, int m, int[] nums2, int n) {
int index = m + n - 1;
int i = m - 1;
int j = n - 1;
while (i >= 0 && j >= 0)
if (nums1[i] >= nums2[j]) {
nums1[index] = nums1[i];
i--;
index--;
} else {
nums1[index] = nums2[j];
j--;
index--;
}
//继续遍历剩下的元素
if (i == -1) {
while (j >= 0) {
nums1[index] = nums2[j];
j--;
index--;
}
}
}