-
Notifications
You must be signed in to change notification settings - Fork 15
/
merge-intervals.cpp
39 lines (37 loc) · 987 Bytes
/
merge-intervals.cpp
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
/**
* 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(Interval lhs, Interval rhs)
{
return lhs.start < rhs.start;
}
vector<Interval> Solution::insert(vector<Interval> &intervals, Interval newInterval) {
intervals.push_back(newInterval);
sort(intervals.begin(), intervals.end(), cmp);
int n = intervals.size();
stack<Interval> s;
s.push(intervals[0]);
for(int i = 1; i < n; i++) {
Interval top = s.top();
if(intervals[i].start > top.end) {
s.push(intervals[i]);
}
else if(intervals[i].end > top.end) {
top.end = intervals[i].end;
s.pop();
s.push(top);
}
}
vector<Interval> merged(s.size());
for(int i = merged.size() - 1; i >= 0; i--) {
merged[i] = s.top();
s.pop();
}
return merged;
}