[LeetCode]Merge Intervals - c++编程基础

[cpp]
struct Interval {
int start;
int end;
Interval() : start(0), end(0) {}
Interval(int s, int e) : start(s), end(e) {}
};

class Solution {
//first sort and then merge, O(nlogn)
public:
struct comp
{
bool operator()(const Interval& lhs, const Interval& rhs) const
{
if(lhs.start != rhs.start) return lhs.start < rhs.start;
else return lhs.end < rhs.end;
}
};
vector merge(vector &intervals) {
// Start typing your C/C++ solution below

// DO NOT write int main() function
if(intervals.size() == 0) return vector();
sort(intervals.begin(), intervals.end(), comp());
vector ans;
Interval tmp = intervals[0];
for (int i = 1; i < intervals.size(); ++i)
{
if(intervals[i].start <= tmp.end)
tmp.end = max(tmp.end, intervals[i].end);
else
{
ans.push_back(tmp);
tmp = intervals[i];
}
}
ans.push_back(tmp);
return ans;
}
};