class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
sort(intervals.begin(),intervals.end());
vector<vector<int>> a;
for(int i=1;i<intervals.size();i++){
if(intervals[i][0]>intervals[i-1][1]){
a.push_back(intervals[i-1]);
}
else{
intervals[i][0]=min(intervals[i-1][0],intervals[i][0]);
intervals[i][1]=max(intervals[i-1][1],intervals[i][1]);
}
}
a.push_back(intervals[intervals.size()-1]);
return a;
}
};
LEETCODE 56. 合并区间
最新推荐文章于 2024-06-15 09:23:13 发布