class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
vector<vector<int> > ans;
sort(intervals.begin(), intervals.end());
for(int ii = 0, jj; ii < intervals.size(); ) {
jj = ii + 1;
int max_right = intervals[ii][1];
while(jj < intervals.size() && intervals[jj][0] <= max_right) {
max_right = max(max_right, intervals[jj][1]);
jj++;
}
ans.push_back({intervals[ii][0], max_right});
ii = jj;
}
return ans;
}
};
04-26
531
09-21
478