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]
解题思路:最后结果要存于num1数组中,设置两个指针m, n,从后往前遍历,分别指向num1与num2中下一个需要排序的数。
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int cnt = m + n;
nums1.resize(cnt);
-- m; -- n;
while(m >= 0 || n >= 0){
if(m == -1)
nums1[-- cnt] = nums2[n --];
else if(n == -1 || nums1[m] > nums2[n])
nums1[-- cnt] = nums1[m --];
else
nums1[-- cnt] = nums2[n --];
}
}
};