57. 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:
static bool cmp(const Interval &a, const Interval &b){
return a.start < b.start;
}

vector<Interval> insert(vector<Interval>& intervals, Interval newInterval) {
intervals.push_back(newInterval);

sort(intervals.begin(), intervals.end(), cmp);

vector<Interval>me;
Interval now;
if(intervals.size() != 0)
now = intervals[0];
for(int i = 1; i < intervals.size(); ++ i){
if(now.end >= intervals[i].start){
now.end = max(now.end, intervals[i].end);
}
else{
me.push_back(now);
now = intervals[i];
}
}
if(intervals.size() != 0)
me.push_back(now);

return me;
}
};