57. Insert Interval

---

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:

Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
Output: [[1,5],[6,9]]

Example 2:

Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
Output: [[1,2],[3,10],[12,16]]
Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].

---

 

 把要插入的元素插入，然后调用上一个题的merge

 

/**
 * 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:
    static bool sfun(Interval a,Interval b){
        return a.start<b.start;
    }
    vector<Interval> insert(vector<Interval>& intervals, Interval newInterval) {
        vector<Interval> res;
        intervals.push_back(newInterval);
        sort(intervals.begin(),intervals.end(),sfun);
        res.push_back(intervals[0]);
        for(int i = 1;i < intervals.size(); i++ ){
            Interval pre =  res.back();////
            Interval now = intervals[i];
            if(now.start >pre.end  )
                res.push_back(now);
            else{
                res.back().start = pre.start;
                res.back().end = max(now.end,pre.end);

            }
        }
        return res;
    }
};