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> ret;
		if(intervals.empty())
		{
		    ret.push_back(newInterval);
		    return ret;
		}
		Interval newOne(0,-1);//无意义的值
		size_t i;//遍历intervals
		intervals.push_back(Interval(INT_MAX,INT_MAX));//用于刹车
		for(i=0;i<intervals.size();)
		{
			if(newInterval.start > intervals[i].end)
			{
				ret.push_back(intervals[i]);
				i++;
			}
			else if(newInterval.start <= intervals[i].start)
			{
				newOne.start=newInterval.start;
				break;
			}else
			{
				newOne.start=intervals[i].start;
				break;
			}
		}
		while(i<intervals.size())
		{
			if(newInterval.end > intervals[i].end)
			{
				i++;
			}
			else if(newInterval.end < intervals[i].start)
			{
				newOne.end=newInterval.end;
				break;
			}else
			{
				newOne.end=intervals[i].end;
				break;
			}
		}
		ret.push_back(newOne);
		if(newOne.end==intervals[i].end)
		{
		    i++;
		}
		while(i<intervals.size()-1)
		{
			ret.push_back(intervals[i]);
			i++;
		}
		return ret;
    }
};

class Solution {
public:
    vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
		vector<Interval> ret;
		if(intervals.empty())
		{
		    ret.push_back(newInterval);
		    return ret;
		}
		auto i=intervals.begin();
		for(;i<intervals.end();++i)
		{
			if(newInterval.start <= (*i).start)
			{
				intervals.insert(i,newInterval);
				break;
			}
		}
		if(i==intervals.end())	intervals.push_back(newInterval);
		merge(intervals,ret);
		return ret;
    }
	void merge(vector<Interval> &intervals,vector<Interval> &ret) {
		if(intervals.empty()) return;
		ret.push_back(intervals[0]);
		for(auto i=1;i<intervals.size();i++)
		{
			if(intervals[i].start <= ret.back().end)
			{
				ret.back().end = max(ret.back().end,intervals[i].end);
			}
			else
			{
				ret.push_back(intervals[i]);
			}
		}
		return ;
    }
};