435无重叠区间.md

func eraseOverlapIntervals(intervals [][]int) int {
    sort.Slice(intervals, func(i, j int) bool {
        return intervals[i][1] < intervals[j][1]
    })
    count := 0
    for i := 1; i < len(intervals); i++ {
        // 重叠即移除
        if intervals[i][0] < intervals[i-1][1] {
            count++
            intervals[i][0] = intervals[i-1][0]
            intervals[i][1] = intervals[i-1][1]
        }
    }
    return count
}