LeetCode-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].

问题解析：

给定间隔数组，和需要插入的间隔，将间隔插入到数组中，返回新数组。

链接：

• LeetCode：https://leetcode.com/problems/insert-interval/description/

思路标签

前和后比较、后与前比较

解答：

• 题目其实不难，关键是理清楚什么时候更新插入的新节点。

/**
 * 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> ret;

        auto iter = intervals.begin();
        while(iter != intervals.end() && iter->end < newInterval.start){
            ret.push_back(*iter);
            iter++;
        }

        while(iter != intervals.end() && iter->start <= newInterval.end){
            newInterval.start = min(newInterval.start, iter->start);
            newInterval.end = max(newInterval.end, iter->end);
            iter++;
        }

        ret.push_back(newInterval);

        while(iter != intervals.end()){
            ret.push_back(*iter);
            iter++;
        }

        return ret;
    }
};