题目:
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.
解答:
归并排序,重点是:如果不使用额外空间怎么办?直接放在 nums1 中,不就覆盖了原有元素么?
但是,nums1 中最后的额外空间是空的,可以从最后端开始放置数字。
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int index = m + n - 1;
int index1 = m - 1;
int index2 = n - 1;
while(index1 >= 0 && index2 >= 0) {
if(nums1[index1] > nums2[index2]) {
nums1[index] = nums1[index1];
index1 --;
}
else {
nums1[index] = nums2[index2];
index2 --;
}
index --;
}
if(index1 <= 0) {
while(index2 >= 0) {
nums1[index] = nums2[index2];
index --;
index2--;
}
}
else if(index2 <= 0) {
while(index1 >= 0) {
nums1[index] = nums1[index1];
index --;
index1--;
}
}
}
};