leetcode-435 无重叠区间

class Solution {
public:
    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        int len = intervals.size();
        int res = 1 ; 

        if(!len) return 0;

    sort(intervals.begin() , intervals.end() , [](const auto & a , const auto & b){
            return a[1] < b[1];
        });

        int right = intervals[0][1];
        for(int i = 1 ; i < len ; i ++ ) {
            if(intervals[i][0] >= right){
                res ++ ;
                right = intervals[i][1];
            }
        }

        return len - res;
    }
};