leetcode: Insert Interval

最简洁的实现

/**
 * 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;
        for( int i = 0; i < intervals.size(); ++i){
            if( intervals[i].end < newInterval.start){
                res.push_back(intervals[i]);
            }
            else{
                if( intervals[i].start > newInterval.end){
                    res.push_back(newInterval);
                    res.insert(res.end(), intervals.begin() + i, intervals.end());
                    return res;
                }
                else{
                    newInterval.start = min( intervals[i].start, newInterval.start);
                    newInterval.end = max( intervals[i].end, newInterval.end);
                }
            }
        }
        res.push_back(newInterval);
        return res;
    }
};