leetcode56

class Solution {
public:
    static bool cmp(const vector<int>& v1,const vector<int>& v2)
    {
        return v1[0]<v2[0];
    }
    vector<vector<int>> merge(vector<vector<int>>& intervals) {
        if(intervals.size() == 0) return intervals;
        sort(intervals.begin(),intervals.end(),cmp);
        for(int i = 0;i<intervals.size()-1;i++)
        {
            for(int j = i+1;j<intervals.size();j++)
            {
                if(intervals[i][1]>=intervals[j][0])
                {
                    intervals[i][1] = max(intervals[i][1],intervals[j][1]);
                    intervals.erase(intervals.begin()+j);
                    i--;
                    break;
                }
            }
        }
        return intervals;
    }
};