-
Notifications
You must be signed in to change notification settings - Fork 3
/
1272.cpp
47 lines (46 loc) · 1.78 KB
/
1272.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
40
41
42
43
44
45
46
47
class Solution {
public:
vector<vector<int>> removeInterval(vector<vector<int>>& intervals, vector<int>& toBeRemoved) {
vector<vector<int>> ans;
int left = toBeRemoved[0];
int right = toBeRemoved[1];
int t;
for (auto interval : intervals) {
// min of current interval's right with remove's left
t = min(interval[1], left);
if (t > interval[0]) ans.push_back({interval[0], t});
// max of current interval's left with remove's right
t = max(interval[0], right);
if (t < interval[1]) ans.push_back({t, interval[1]});
}
return ans;
}
};
class Solution {
public:
vector<vector<int>> removeInterval(vector<vector<int>>& intervals, vector<int>& toBeRemoved) {
vector<vector<int>> res;
for (auto& interval : intervals) {
int left = max(interval[0], toBeRemoved[0]);
int right = min(interval[1], toBeRemoved[1]);
// case 0: no touch
if (left >= right) res.push_back(interval);
// case 1: toBeRemoved cover interval
else if (interval[0] >= toBeRemoved[0] && interval[1] <= toBeRemoved[1]) continue;
// case 2: interval cover toBeRemoved
else if (interval[0] < toBeRemoved[0] && interval[1] > toBeRemoved[1]) {
res.push_back({interval[0], toBeRemoved[0]});
res.push_back({toBeRemoved[1], interval[1]});
}
// case 3: right touch
else if (interval[0] < toBeRemoved[0]) {
res.push_back({interval[0], toBeRemoved[0]});
}
// case 4: left touch
else {
res.push_back({toBeRemoved[1], interval[1]});
}
}
return res;
}
};