leetcode

0 class Solution {

1 typedef vector<int> Interval;

2

3 public:

4 vector<Interval> insert(vector<Interval> &intervals, Interval &newInterval) {

5 if (intervals.empty()) return {newInterval};

6

7 vector<Interval> res;

8 int n = intervals.size(), i = 0;

9 for (; i < n && intervals[i][1] < newInterval[0]; i++) {

10 res.push_back(intervals[i]);

11 }

12

13 for (; i < n && newInterval[1] >= intervals[i][0]; i++) {

14 newInterval[0] = min(newInterval[0], intervals[i][0]);

15 newInterval[1] = max(newInterval[1], intervals[i][1]);

16 }

17

18 res.push_back(newInterval);

19

20 for (; i < n; i++) {

21 res.push_back(intervals[i]);

22 }

23

24 return res;

25 }

26 };