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> result;
        if(intervals.empty()) {
            result.push_back(newInterval);
            return result;
        }
        int start_index = -1;
        bool mergedOrInsert = false;
        for(int i = 0; i < intervals.size(); i++) {
            if(newInterval.start >= intervals[i].start && newInterval.end <= intervals[i].end) { //case 1: newInerval included in on inerval
                mergedOrInsert = true;
                result.push_back(intervals[i]);
            } else if((newInterval.end < intervals[i].start && (i == 0 || newInterval.start > intervals[i - 1].end))) {
                mergedOrInsert = true;
                result.push_back(newInterval);
                result.push_back(intervals[i]);
            } else if(newInterval.end > intervals[i].end && newInterval.start >= intervals[i].start && newInterval.start <= intervals[i].end) {
                start_index = i;
            } else if(newInterval.start < intervals[i].start && newInterval.end >= intervals[i].start && newInterval.end <= intervals[i].end) {
                mergedOrInsert = true;
                if(start_index == -1) {
                    Interval temp(newInterval.start, intervals[i].end);
                    result.push_back(temp);
                } else {
                    Interval temp(intervals[start_index].start, intervals[i].end);
                    result.push_back(temp);
                }
            } else if(intervals[i].start > newInterval.end) {
                if(!mergedOrInsert) {
                    mergedOrInsert = true;
                    if(start_index == -1) {
                        result.push_back(newInterval);
                    } else {
                        Interval temp(intervals[start_index].start, newInterval.end);
                        result.push_back(temp);
                    }
                }
                result.push_back(intervals[i]);
            }else if(intervals[i].end < newInterval.start) {
                result.push_back(intervals[i]);
            }
        }
        if(!mergedOrInsert) {
            int last_index = intervals.size() - 1;
            if(start_index != -1) {
                Interval temp(intervals[start_index].start, newInterval.end);
                result.push_back(temp);
            } else {
                result.push_back(newInterval);
            }
             mergedOrInsert = true;
        }
        return result;
    }
};