/**

 * Definition for an interval.

 * struct Interval {

 *     int start;

 *     int end;

 *     Interval() : start(0), end(0) {}

 *     Interval(int s, int e) : start(s), end(e) {}

 * };

 */

bool cmp(const Interval &a, const Interval &b){

    return a.start < b.start;

}

class Solution {

public:

    vector<Interval> merge(vector<Interval> &intervals) {

        if(intervals.size() == )

            return intervals;

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

        vector<Interval> result;

        Interval mover = intervals[];

        for(int i = ; i < intervals.size(); ++i){

            if(mover.end < intervals[i].start){

                result.push_back(mover);

                mover = intervals[i];

            }else{

                mover.end = max(mover.end, intervals[i].end);

            }

        }

        result.push_back(mover);

        return result;

    }

};