aboutsummaryrefslogtreecommitdiff
path: root/insert_interval.cpp
blob: 50e16f8237445df2300c102d21e8bffea9bea01e (plain)
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
#include "leetcode.h"

class Solution {
public:
  vvd insert(vvd & intervals, vector<int> &newInterval) {
    const int START = 0, END = 1;
    int s = newInterval[START], e = newInterval[END];
    vvd left, right;
    for (auto &curr : intervals) {
      if (curr[END] < s)
        left.push_back(curr);
      else if (curr[START] > e)
        right.push_back(curr);
      else {
        s = min(s, curr[START]);
        e = max(e, curr[END]);
      }
    }
    vvd ans;
    ans.insert(ans.end(), left.begin(), left.end());
    ans.push_back({s, e});
    ans.insert(ans.end(), right.begin(), right.end());
    return ans;
  }
};

int main() {
  Solution obj;
  vvd intervals1 = {{1, 3}, {6, 9}},
           intervals2 = {{1, 2}, {3, 5}, {6, 7}, {8, 10}, {12, 16}};
  vector<int> newInterval1 = {2, 5}, newInterval2 = {4, 8};
  for (auto i : obj.insert(intervals1, newInterval1))
    for (auto j : i)
      cout << j << ' '; // expect: [[1,5],[6,9]]
  cout << endl;
  for (auto i : obj.insert(intervals2, newInterval2))
    for (auto j : i)
      cout << j << ' '; // expect: [[1,2],[3,10],[12,16]]
}