无重叠区间

Leetcode题目链接

描述

详见中文题目链接。

解答

class Solution {
public:
    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        sort(intervals.begin(), intervals.end(), [](vector<int>& lhs, vector<int>& rhs) {
            return lhs[1] < rhs[1];
        });

        int res = 1, end = intervals[0][1];
        for (int i = 1; i < intervals.size(); i++) {
            if (intervals[i][0] >= end) {
                res++;
                end = intervals[i][1];
            }
        }

        return intervals.size() - res;
    }
};