LeetCode:56. 合并区间

class Solution { public: vector<vector<int>> merge(vector<vector<int>>& intervals) { vector<vector<int>>res; sort(intervals.begin(),intervals.end()); for(int i=0;i<intervals.size();i++) { for(int j=0;j<intervals[i].size();j++) { cout<<intervals[i][j]<<"\t"; } cout<<endl; } int i=0; for(i=0;i<intervals.size();i++) { int left=intervals[i][0]; int right=intervals[i][1]; while(i<intervals.size()&&right>=intervals[i][0]) { right=right>intervals[i][1]?right:intervals[i][1]; i++; } res.push_back({left,right}); i--; } return res; } };