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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int len = intervals.size();
        vector<Interval> rec;
      
        int i = 0;
        while (i < len && newInterval.start > intervals[i].end) {
            rec.push_back(intervals[i]);
            i++;
        }
      
        while (i < len && newInterval.end >= intervals[i].start) {
            newInterval.start = min(intervals[i].start, newInterval.start);
            newInterval.end = max(intervals[i].end, newInterval.end);
            i++;
        }
       
        rec.push_back(newInterval);
       
        while (i < len) {
            rec.push_back(intervals[i]);
            i++;
        }
       
        return rec;
    }
};