LeetCodeInCpp/insert_interval.cpp at master · yingl/LeetCodeInCpp · GitHub

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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
class Solution {
public:
  bool merge(Interval &left, Interval &right) {
    if ((right.start <= left.start) && (right.end >= left.start)) {
      left.start = right.start;
      left.end = (left.end > right.end) ? left.end : right.end;
    }
    else if ((right.start >= left.start) && (right.start <= left.end)) {
      left.end = (left.end > right.end) ? left.end : right.end;
    }
    else {
      return false;
    }

    return true;
  }

  vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
    vector<Interval> result;
    bool inserted = false;

    for (int i = 0; i < intervals.size(); ++i) {
      if (!inserted) {
        if (merge(newInterval, intervals[i])) {
          result.push_back(newInterval);
          inserted = true;
        }
        else {
          if (newInterval.end < intervals[i].start) {
            result.push_back(newInterval);
            inserted = true;
            --i;
          }
          else {
            result.push_back(intervals[i]);
          }
        }
      }
      else {
        int size = result.size();

        if (!merge(result[size - 1], intervals[i])) {
          result.push_back(intervals[i]);
        }
      }
    }

    if (!inserted) {
      result.push_back(newInterval);
    }

    return result;
  }
};