//原地插入,没有另外开辟空间,插入使用vector的insert
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int nums1i = 0;
for (int i = 0; i < n; i++) {
while (nums1[nums1i] < nums2[i] && nums1i < m+i) {
nums1i++;
}
nums1.pop_back();
nums1.insert(nums1.begin() + nums1i, nums2[i]);
nums1i++;
}
}
};
int main()
{
Solution sol;
vector<int> input1 = { 1,2,3,0,0,0 }, input2 = {2,5,6};
sol.merge(input1, 3, input2, 3);
for (int i = 0; i < input1.size(); i++) {
cout << input1[i] << ',';
}
cout << endl;
return 0;
}