LeetCode 57. Insert Interval

#include <iostream>
#include <vector>
using namespace std;

/*
  Given a set of non-overlapping intervals, insert a new interval into the intervals(merge is necessary)
  You may assume that the intervals were initially sorted according to their start times.
  1> Given intervals [1, 3], [6, 9], insert and merge [2, 5] in as [1, 5], [6, 9];
  2> Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9] in as [1,2],[3,10],[12,16].
     This is because the new interval [4,9] overlaps with [3,5],[6,7],[8,10]. 
*/
struct Interval {
  int start;
  int end;
  Interval() : start(0), end(0) {}
  Interval(int s, int e): start(s), end(e) {}
};

vector<Interval> insert(vector<Interval>& intervals, Interval newInterval) {
  int n = intervals.size();
  if(n == 0) return {newInterval};
  int i = 0;
  Interval tmp;
  vector<Interval> res;
  while(i < n && newInterval.start > intervals[i].end) {
    res.push_back(intervals[i]);
    i++;
  }
  while(i < n && newInterval.end >= intervals[i].start) {
    newInterval.end = max(newInterval.end, intervals[i].end);
    newInterval.start = min(newInterval.start, intervals[i].start);
    i++;
  }
  res.push_back(newInterval);
  while(i < n) {
    res.push_back(intervals[i]);
    i++;
  }
  return res;
}
void printInterval(vector<Interval> intervals) {
  for(int i = 0; i < intervals.size(); ++i) {
    cout << "[" << intervals[i].start << "," << intervals[i].end << "] ";
  }
  cout << endl;
}

int main(void) {
  vector<Interval> example_1{Interval(1, 3), Interval(6, 9)};
  Interval tmp_interval(2, 5);

  vector<Interval> res = insert(example_1, tmp_interval);
  printInterval(res);

  vector<Interval> example_2{Interval(1, 2), Interval(3, 5), Interval(8, 10), Interval(12, 16)};
  Interval tmp(4, 9);

  vector<Interval> res_1 = insert(example_2, tmp);
  printInterval(res_1);
}