Insert Interval LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<vector<int>> insert(vector<vector<int>> &intervals, vector<int> &newInterval) {
4
    vector<vector<int>> output;
5
    int n = intervals.size();
6
    int i = 0;
7
    while (i < n) {
8
      if (newInterval[1] < intervals[i][0]) {
9
        output.push_back(newInterval);
10
        while (i < n) {
11
          output.push_back(intervals[i]);
12
          i++;
13
        }
14
        return output;
15
      } else if (newInterval[0] > intervals[i][1]) {
16
        output.push_back(intervals[i]);
17
        i++;
18
      } else {
19
        newInterval[0] = min(newInterval[0], intervals[i][0]);
20
        newInterval[1] = max(newInterval[1], intervals[i][1]);
21
        i++;
22
      }
23
    }
24
    output.push_back(newInterval); // think about it
25
    return output;
26
  }
27
};