Ayingotts's notes

Appearance

435-无重叠区间 ​

思路：贪心

ts
function eraseOverlapIntervals(intervals: number[][]): number {
  intervals.sort((a, b) => a[1] - b[1])
  let count = 1
  let end = intervals[0][1]

  for (let i = 1; i < intervals.length; i++) {
    const inv = intervals[i]
    if (inv[0] >= end) {
      end = inv[1]
      // 额外的区间
      count++
    }
  }

  return intervals.length - count
}
function eraseOverlapIntervals(intervals: number[][]): number {
  intervals.sort((a, b) => a[1] - b[1])
  let count = 1
  let end = intervals[0][1]

  for (let i = 1; i < intervals.length; i++) {
    const inv = intervals[i]
    if (inv[0] >= end) {
      end = inv[1]
      // 额外的区间
      count++
    }
  }

  return intervals.length - count
}