LeetCode 56. 合并区间

最新推荐文章于 2024-10-16 22:34:48 发布

nuita

最新推荐文章于 2024-10-16 22:34:48 发布

阅读量46

点赞数

本文链接：https://blog.csdn.net/qq_25155231/article/details/127390843

版权

class Solution {
public:
    vector<vector<int>> merge(vector<vector<int>>& intervals) {
        vector<vector<int>>ans;
        int x_start, x_end;
        sort(intervals.begin(), intervals.end());
        x_start = intervals[0][0];
        x_end = intervals[0][1];
        for (int i = 0; i < intervals.size(); i++) {
            if (intervals[i][0]<=x_end && intervals[i][1]>x_end)
                x_end = intervals[i][1];
            else if (intervals[i][0] > x_end) {
                ans.push_back({ x_start,x_end });
                x_start = intervals[i][0];
                x_end = intervals[i][1];
            }
        }
        ans.push_back({ x_start,x_end });
        return ans;
    }
};