Insert Interval [leetcode]

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<Interval> insert(vector<Interval> &intervals, Interval newInterval) {        int start = 0, end = 0;        for (; start < intervals.size() && intervals[start].end < newInterval.start; start++);        for (end = start; end < intervals.size() && intervals[end].start <= newInterval.end; end++);        end--;        if (start <= end && start < intervals.size())        {            intervals[start].start = min(intervals[start].start, newInterval.start);            intervals[start].end = max(intervals[end].end, newInterval.end);            if (start < end)                intervals.erase(intervals.begin() + start + 1, intervals.begin() + end + 1);        }        else            intervals.insert(intervals.begin() + start, newInterval);        return intervals;    }