forked from sunstick/code-street
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmerge_interval.cpp
More file actions
53 lines (44 loc) · 1.24 KB
/
merge_interval.cpp
File metadata and controls
53 lines (44 loc) · 1.24 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/*
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].
*/
/**
* 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 &inter1, const Interval &inter2) {
return inter1.start < inter2.start;
}
class Solution {
public:
vector<Interval> merge(vector<Interval> &intervals) {
vector<Interval> res;
if (intervals.size() == 0) return res;
sort(intervals.begin(), intervals.end(), cmp);
int s = -1, e = -1;
for (int i = 0; i < intervals.size(); i++) {
if (s == -1) {
s = intervals[i].start;
e = intervals[i].end;
continue;
}
if (e < intervals[i].start) { // no overlap
res.push_back(Interval(s, e));
s = intervals[i].start;
e = intervals[i].end;
} else { // overlap
e = max(e, intervals[i].end);
}
}
if (s != -1)
res.push_back(Interval(s, e));
return res;
}
};