1.12 刚写完开题报告
这道题小难吧A了2h,累闷了,中间还用演算纸算了好久跟做数学题似的。先上我自己的题解。
1)排序去重
2)比较前后区间
注意端点值讨论以及溢出问题
class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
vector<vector<int>> v;
sort(intervals.begin(),intervals.end());
intervals.erase(unique(intervals.begin(), intervals.end()), intervals.end());
int a=intervals[0][0];
int b=intervals[0][1];
for(int i=0;i<intervals.size()-1;i++)
{
if(intervals[i][1]>=intervals[i+1][0])
{ if(intervals[i][0]<a)
{ a=intervals[i][0];
}
if(intervals[i+1][1]>b)
{
b=intervals[i+1][1];
}
}
if(intervals[i][1]<intervals[i+1][0])
{ if(intervals[i+1][0]>=a&&intervals[i+1][1]<=b)
{ continue;
}
if(intervals[i+1][0]<=b)
{
if(intervals[i+1][1]>b)
{
b=intervals[i+1][1];
}
continue;
}
vector<int> temp;
temp.push_back(a);
temp.push_back(b);
v.push_back(temp);
a=intervals[i+1][0];
b=intervals[i+1][1];
}
}
if(intervals[intervals.size()-1][0]>a&&intervals[intervals.size()-1][0]<=b)
{if(intervals[intervals.size()-1][1]>b)
{
b=intervals[intervals.size()-1][1];
}
vector<int> temp;
temp.push_back(a);
temp.push_back(b);
v.push_back(temp);
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
return v;
}
vector<int> temp;
temp.push_back(a);
temp.push_back(b);
v.push_back(temp);
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
return v;
}
};