题目:
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 nrespectively.
- 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]
描述:
给出两个已排序数组,要求将两个数组合并成一个数组,其中第一个数组最后已经缺省了需要的位置
分析:
刚开始没看懂题目描述,后来发现是一个送分题...
既然是排序,当然快排是最快的,但是第一个数组有缺省项,因此需要先删除缺省项,
随后两个数组合并后,再进行排序
代码:
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
for (int i = nums1.size() - 1; i >= m; -- i) {
nums1.pop_back();
}
for (int i = 0; i < n; ++ i) {
nums1.push_back(nums2[i]);
}
sort(nums1.begin(), nums1.begin() + m + n);
}
};