Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
- vector<vector<int>> res;
- int index = 0;
- while(index < intervals.size() && intervals[index][1] < newInterval[0]){
- res.push_back(intervals[index++]);
- }
- while(index < intervals.size() && intervals[index][0] <= newInterval[1]){
- newInterval[0] = min(newInterval[0], intervals[index][0]);
- newInterval[1] = max(newInterval[1], intervals[index][1]);
- index++;
- }
- res.push_back(newInterval);
- while(index < intervals.size()){
- res.push_back(intervals[index++]);
- }
- return res;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement