Given a collection of intervals, merge all overlapping intervals.
For example,
Given [1,3],[2,6],[8,10],[15,18]
,
return [1,6],[8,10],[15,18]
.
Code:
<span style="font-size:14px;">/**
* 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 smaller(const Interval &a, const Interval &b) {
if (a.start < b.start) return true;
else if (a.start == b.start && a.end < b.end) return true;
else return false;
}
class Solution {
public:
vector<Interval> merge(vector<Interval> &intervals) {
const int length = intervals.size();
if (length == 0 || length == 1) return intervals;
sort(intervals.begin(), intervals.end(), smaller);
Interval temp = intervals[0];
vector<Interval> result;
for (int i = 1; i < length; ++i)
if (temp.end >= intervals[i].start) temp.end = max(temp.end, intervals[i].end);
else {
result.push_back(temp);
temp = intervals[i];
}
result.push_back(temp);
return result;
}
};</span>