LeetCode 435. 无重叠区间(Javascript)

/**
 * @param {number[][]} intervals
 * @return {number}
 */
var eraseOverlapIntervals = function(intervals) {
    let MAXVAL = -Number.MAX_VALUE;
    let ans = 0;
    intervals.sort((a,b)=>a[1]-b[1]);
    intervals.forEach((i)=>{
        if (i[0]>=MAXVAL){
            MAXVAL = i[1];
            ans++;
        }
    })
    return intervals.length-ans;
};