2023.07.19 Today's Challenge

https://leetcode.com/problems/non-overlapping-intervals/

Non-overlapping Intervals - LeetCode

겹치지 않는 인터벌을 구하는 문제

class Solution:
    def eraseOverlapIntervals(self, intervals: List[List[int]]) -> int:
        intervals.sort(key=lambda x: x[1])
        ans = 0
        k = -inf

        for x, y in intervals:
            if x >= k:
                k = y
                continue
            ans += 1
        
        return ans