LeetCode - Merge Intervals

[1,3],[2,6],[8,10],[15,18]

[1,6],[8,10],[15,18]

/**
* Definition for an interval.
* struct Interval {
*     int start;
*     int end;
*     Interval() : start(0), end(0) {}
*     Interval(int s, int e) : start(s), end(e) {}
* };
*/
bool cmp(const Interval &a, const Interval &b){
if(a.start==b.start){
return a.end<b.end;
}
return a.start<b.start;
}
class Solution {
public:
vector<Interval> merge(vector<Interval> &intervals) {
vector<Interval> result;
if(intervals.empty()||intervals.size()==0){
return result;
}
sort(intervals.begin(),intervals.end(),cmp);

Interval tmp=intervals[0];
for(int i=1;i<intervals.size();i++){
if(tmp.end<intervals[i].start){
result.push_back(tmp);
tmp=intervals[i];
}else{
tmp.end=max(tmp.end,intervals[i].end);
}
}
result.push_back(tmp);
return result;
}
};