forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathys-han00.cpp
More file actions
58 lines (49 loc) · 1.68 KB
/
ys-han00.cpp
File metadata and controls
58 lines (49 loc) · 1.68 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
class Solution {
public:
vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
vector<vector<int>> ans;
int n = intervals.size();
int i = 0;
while (i < n && intervals[i][1] < newInterval[0]) {
ans.push_back(intervals[i]);
i++;
}
while (i < n && intervals[i][0] <= newInterval[1]) {
newInterval[0] = min(newInterval[0], intervals[i][0]);
newInterval[1] = max(newInterval[1], intervals[i][1]);
i++;
}
ans.push_back(newInterval);
while (i < n) {
ans.push_back(intervals[i]);
i++;
}
return ans;
}
// vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
// vector<vector<int>> ans;
// bool tmp = false;
// int left = newInterval[0], right = newInterval[1];
// for(int i = 0; i < intervals.size(); i++) {
// if(intervals[i][1] < left) {
// ans.push_back(intervals[i]);
// continue;
// }
// else if(right < intervals[i][0]) {
// if(!tmp) {
// ans.push_back(vector<int>({left, right}));
// tmp = true;
// }
// ans.push_back(intervals[i]);
// continue;
// }
// else {
// left = min(left, intervals[i][0]);
// right = max(right, intervals[i][1]);
// }
// }
// if(!tmp)
// ans.push_back(vector<int>({left, right}));
// return ans;
// }
};