LeetCode 0057 - 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;
        auto it = intervals.begin();
        for(; it != intervals.end(); it++){
            if(it->start > newInterval.end)
                break;
            else if(it->end < newInterval.start)
                res.push_back(*it);
            else
                newInterval.start = min(newInterval.start, it->start), newInterval.end = max(newInterval.end, it->end);
        }
        res.push_back(newInterval);
        for(; it != intervals.end(); it++)
            res.push_back(*it);
        return res;
    }
};