Merge Intervals [leetcode]

bool static cmp(const Interval& i1, const Interval& i2){return i1.start < i2.start;}vector<Interval> merge(vector<Interval> &intervals) {vector<Interval> res;if (intervals.size() == 0)return res;sort(intervals.begin(), intervals.end(), this->cmp);res.push_back(intervals[0]);int resI = 0;for (int i = 1 ; i < intervals.size(); i++){if (intervals[i].start <= res[resI].end)res[resI].end = intervals[i].end >res[resI].end ? intervals[i].end : res[resI].end;else{res.push_back(intervals[i]);resI++;}}return res;}