class Solution {
public:
vector<vector<int>> insert(vector<vector<int>>& vals, vector<int>& val) {
int n = vals.size();
int i = 0;
vector<vector<int>> ans;
while (i < n && vals[i][1] < val[0]) {
ans.push_back(vals[i]);
++i;
}
while (i < n && vals[i][0] <= val[1]) {
val[0] = min(val[0], vals[i][0]);
val[1] = max(val[1], vals[i][1]);
++i;
}
ans.push_back(val);
while (i < n) {
ans.push_back(vals[i]);
++i;
}
return ans;
}
};
one pass solution
'알고리즘 > leetcode' 카테고리의 다른 글
1588. Sum of All Odd Length Subarrays (0) | 2022.09.13 |
---|---|
496. Next Greater Element I (0) | 2022.09.13 |
16. 3Sum Closest (0) | 2022.08.28 |
417. Pacific Atlantic Water Flow (0) | 2022.08.26 |
173. Binary Search Tree Iterator (0) | 2022.08.24 |