[LeetCode 解题报告]057. 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].

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

考察：与056完全相似；

class Solution {
public:
    vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
        intervals.push_back(newInterval);
        
        vector<vector<int> > res;
        sort(intervals.begin(), intervals.end(), cmp);
        res.push_back(intervals[0]);
        
        for (int i = 1; i < intervals.size(); i ++) {
            if(res[res.size()-1][1] < intervals[i][0])
                res.push_back(intervals[i]);
            else 
                res[res.size()-1][1] = max(res[res.size()-1][1], intervals[i][1]);
        }
        return res;
    }
    
    static bool cmp(const vector<int> &a, const vector<int> &b) {
        return a[0] < b[0];
    }    
    
};