leetcode56划分区间

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


                int a = intervals[i][1];
                int b = intervals[j][0];
            }
            res.push_back({ intervals[i][0], intervals[i][1] });
            i = j;



        }
        return res;
    }
};

剁手