LeetCode56. 合并区间
class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals);
};
vector<vector<int>> Solution::merge(vector<vector<int>>& intervals)
{
vector<vector<int>> res;
if(intervals.size()==0)
{
return res;
}
sort(intervals.begin(), intervals.end(), [](const vector<int>& v1, const vector<int>& v2){
return v1[0]<v2[0];
});
res.push_back(intervals[0]);
int index =0;
for(int i =0; i<intervals.size(); ++i)
{
if(res[index][1]>= intervals[i][0])
{
res[index][1]=intervals[i][1]>res[index][1]?intervals[i][1]:res[index][1];
}
else
{
res.push_back(intervals[i]);
++index;
}
}
return res;
}
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/80eeed5d71291d7083ccf3317fdca826.png)