56.合并区间

Problem

leetcode链接problem

Code

using namespace std;
class Solution {
public:
    vector<vector<int>> merge(vector<vector<int>>& intervals) {
        int len = intervals.size();
        sort(intervals.begin(),intervals.end());
        vector<vector<int>> res;
        vector<int> temp;
        if(intervals.size() == 0)
            return intervals;
        res.push_back(intervals[0]);//先把第一个放进去吧
        int index = 0;//res的索引
        for(int i = 1;i <= len - 1;i++)
        {   
            if(res[index][1] >= intervals[i][0])
            {
                if(res[index][1] < intervals[i][1]){
                    res[index][1] = intervals[i][1];
                }
            }
            else{
                res.push_back(intervals[i]);
                index++;
            }
        }
        return res;
    }
};