-
Notifications
You must be signed in to change notification settings - Fork 95
/
insert-interval.cpp
39 lines (39 loc) · 1.29 KB
/
insert-interval.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) {}
* };
*/
class Solution {
public:
vector<Interval> v;
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
if(intervals.empty())
return vector<Interval>(1, newInterval);
v.clear();
for(int i = 0; i < intervals.size(); ++i) {
if(newInterval.start <= intervals[i].end) {
if(newInterval.start > intervals[i].start)
swap(newInterval, intervals[i]);
v.push_back(newInterval);
for(int j = i; j < intervals.size(); ++j) {
if(intervals[j].start > v.back().end) {
v.push_back(intervals[j]);
} else {
v.back().end = max(v.back().end, intervals[j].end);
}
}
return v;
} else {
v.push_back(intervals[i]);
}
}
v.push_back(newInterval);
return v;
}
};