-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathInsertInterval.cpp
More file actions
54 lines (46 loc) · 1.41 KB
/
InsertInterval.cpp
File metadata and controls
54 lines (46 loc) · 1.41 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
54
/**
Given a set of non-overlapping intervals, insert a new interval into the intervals
(merge if necessary).
You may assume that the intervals were initially sorted according to their start times.
Example 1:
Given intervals [1,3],[6,9], insert and merge [2,5] in as [1,5],[6,9].
Example 2:
Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9] in as [1,2],[3,10],[12,16].
This is because the new interval [4,9] overlaps with [3,5],[6,7],[8,10].
*/
/**
* 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> insert(vector<Interval> &intervals, Interval newInterval) {
if (intervals.empty()) {
intervals.push_back(newInterval);
return intervals;
}
Interval temp = newInterval;
vector<Interval> res;
for (size_t i = 0; i < intervals.size(); ++i) {
Interval currInterval = intervals[i];
if (temp.end < currInterval.start) {
res.push_back(temp);
temp = currInterval;
}
else if (temp.start > currInterval.end) {
res.push_back(currInterval);
}
else {
temp.start = std::min(temp.start, currInterval.start);
temp.end = std::max(temp.end, currInterval.end);
}
}
res.push_back(temp);
return res;
}
};