lc-go/solutions/4/q435/solution.go
2026-02-01 14:56:08 +09:00

22 lines
364 B
Go

package q435
import (
"math"
"slices"
)
func eraseOverlapIntervals(intervals [][]int) int {
slices.SortFunc(intervals, func(a, b []int) int { return a[1] - b[1] })
keep := 0
end := math.MinInt
for i := range intervals {
if intervals[i][0] >= end {
end = intervals[i][1]
keep++
}
}
return len(intervals) - keep
}
var _ = eraseOverlapIntervals