题意:两个有序vector 合并保持有序
class Solution { public: void merg(vector<int>& num1, int m, vector<int>& num2, int n) { vector<int>ret; int i=0,j=0; while (i < n && j < m) { if (num1[i] <= num2[j]) { ret.push_back(num1[i]); i++; } else { ret.push_back(num2[j]); j++; } } while (i < m) { ret.push_back(num1[i]); i++; } while (j < n) { ret.push_back(num2[j]); j++; } num1 = ret; } };