LeetCode 题解（34）: 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:
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].

题解：

用一个vector<int>记录overlap的位置，比如Example 2中重叠位置为：1，2，3.

在原vector<Interval>中删除所有overlap的区间 vector.erase(overlap.start, overlap.end)。

插入新区间，新区间的start为min(overlap[0].start, new.start)，新区间的end为max(overlap[last].end, new.end)。

插入后重新排序。

class Solution {
public:
    vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
        vector<int> overlap;
        int count = 0;
        for(auto iter: intervals)
        {
            if(!(iter.start > newInterval.end || iter.end < newInterval.start) )
                overlap.push_back(count);
            count++;
        }
        
        if(!overlap.size())
            intervals.push_back(newInterval);
        else
        {
            newInterval.start = min(intervals[overlap[0]].start, newInterval.start);
            newInterval.end = max(intervals[overlap[overlap.size()-1]].end, newInterval.end);

            vector<Interval>::iterator iterS = intervals.begin();
            vector<Interval>::iterator iterE = intervals.begin();
            iterS += overlap[0];
            iterE += overlap[overlap.size()-1];
            if(iterS == iterE)
                intervals.erase(iterS);
            else
                intervals.erase(iterS, iterE+1);
            intervals.push_back(newInterval);
        }
        
        sort(intervals.begin(), intervals.end(), this->comp);
        return intervals;
    }
    
    static bool comp(const Interval & A, const Interval & B)
    {
        return A.start < B.start;
    }
};