class Solution public static bool cmpconst vectorint& a const vectorint& b return a0 b0; int eraseOverlapIntervalsvectorvectorint& intervals int result = 1; sortinter

class Solution { bool cmp(List a, List b) { return a[0] < b[0]; }

int eraseOverlapIntervals(List<List<int>> intervals) {
    int result = 1;
    intervals.sort(cmp);
    for(int i = 1; i < intervals.length; i++) {
        if(intervals[i][0] >= intervals[i-1][1]) 
            result++;
        else 
            intervals[i][1] = min(intervals[i][1],intervals[i-1][1]);
    }
    return intervals.length - result;
}

}