Leetcode 57. Insert Interval (Medium) (cpp)
Tag: Array, Sort
Difficulty: Hard
/*
57. Insert Interval (Medium)
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).
You may assume that the intervals were initially sorted according to their start times.
Example 1:
Given intervals [1,3],[6,9], insert and merge [2,5] in as [1,5],[6,9].
Example 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].
*/
/**
* Definition for an interval.
* struct Interval {
* int start;
* int end;
* Interval() : start(0), end(0) {}
* Interval(int s, int e) : start(s), end(e) {}
* };
*/
class Solution {
public:
vector<Interval> insert(vector<Interval>& intervals, Interval newInterval) {
vector<Interval> res;
bool flag = false;
for (Interval inter : intervals) {
if (flag) {
res.push_back(inter);
} else {
if (newInterval.end < inter.start) {
res.push_back(newInterval);
flag = true;
res.push_back(inter);
} else if (inter.end < newInterval.start) {
res.push_back(inter);
} else {
newInterval.start = min(newInterval.start, inter.start);
newInterval.end = max(newInterval.end, inter.end);
}
}
}
if (!flag) {
res.push_back(newInterval);
}
return res;
}
};