-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathInsert_Interval.cpp
More file actions
127 lines (115 loc) · 3.37 KB
/
Copy pathInsert_Interval.cpp
File metadata and controls
127 lines (115 loc) · 3.37 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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/**
* 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) {
vector<Interval> result;
if(intervals.empty()){
result.push_back(newInterval);
return result;
}
int i;
for(i = 0; i < intervals.size(); i++){
if(intervals[i].end < newInterval.start){
result.push_back(intervals[i]);
}else if(intervals[i].start > newInterval.end){
break;
}else{
newInterval.start = min(newInterval.start, intervals[i].start);
newInterval.end = max(newInterval.end, intervals[i].end);
}
}
result.push_back(newInterval);
while(i < intervals.size()){
result.push_back(intervals[i]);
i++;
}
return result;
}
};
/**
* 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) {
vector<Interval> result;
if(intervals.empty()){
result.push_back(newInterval);
return result;
}
auto ind_it = lower_bound(intervals.begin(), intervals.end(), newInterval, interval_cmp);
intervals.insert(ind_it, newInterval);
int i = 1;
int n = intervals.size();
int s, e;
s = intervals[0].start;
e = intervals[0].end;
while(i < n){
if(intervals[i].start <= e){
e = max(e, intervals[i].end);
}else{
result.push_back(Interval(s, e));
s = intervals[i].start;
e = intervals[i].end;
}
i++;
}
result.push_back(Interval(s, e));
return result;
}
private:
static bool interval_cmp(const Interval &lhs, const Interval &rhs){
return lhs.start < rhs.start;
}
};
/**
* 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) {
vector<Interval> result;
if(intervals.empty()){
result.push_back(newInterval);
return result;
}
auto it = intervals.begin();
while(it != intervals.end()){
if(it->end < newInterval.start){
++it;
}else if(it->start > newInterval.end){
break;
}else{
newInterval.start = min(it->start, newInterval.start);
newInterval.end = max(it->end, newInterval.end);
it = intervals.erase(it);
}
}
intervals.insert(it, newInterval);
return intervals;
}
private:
static bool interval_cmp(const Interval &lhs, const Interval &rhs){
return lhs.start < rhs.start;
}
};