Day 35 贪心算法 - 无重叠区间

435. 无重叠区间 function eraseOverlapIntervals(intervals: number[][]): number { let result = 0; intervals.sort((a, b) => a[0] - b[0]); for (let i = 1; i < intervals.length; i++) { if (intervals[i][0] < intervals[i - 1][1]) { ...