题目:
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]
代码:
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
for(int i = 0, j = 0; i < m+n && j < n; i++)
{
if(i - j == m)
{
nums1.erase(nums1.begin()+i, nums1.end());
nums1.insert(nums1.begin()+i, nums2.begin()+j, nums2.end());
break;
}
if(nums1[i] > nums2[j])
{
nums1.insert(nums1.begin()+i, nums2[j]);
j++;
}
}
nums1.erase(nums1.begin() + m + n, nums1.end());
return;
}
};