leetcode56合并区间

1、题目

https://leetcode-cn.com/problems/merge-intervals/

2、题意

题解1：双指针

class Solution {
public:
    vector<vector<int>> merge(vector<vector<int>>& intervals) {
        sort(intervals.begin(),intervals.end());
        vector<vector<int>> res;
        for(int i=0;i<intervals.size();)
        {
            int maxn = intervals[i][1];
            int j = i+1;
            while(j<intervals.size()&&intervals[j][0]<=maxn)
            {
                maxn = max(intervals[j][1],maxn);
                j++;
            }
            res.push_back({intervals[i][0],maxn});
            i = j;
        }
        return res;
    }
};