Today's Challenge

https://leetcode.com/problems/my-calendar-iii/

My Calendar III - LeetCode

Hard 난이도라 시작하기 전부터 살짝 쫄음 =_=;;
Balanced Tree를 이용한 방법으로 솔루션 참고

from sortedcontainers import SortedList

class MyCalendarThree:

    def __init__(self):
        self.starts = SortedList([[0, 0]])
        self.res = 0
    
    def split(self, x: int) -> None:
        idx = self.starts.bisect_left([x, 0])
        if idx < len(self.starts) and self.starts[idx][0] == x:
            return idx
        self.starts.add([x, self.starts[idx-1][1]])        

    def book(self, start: int, end: int) -> int:
        self.split(start)
        self.split(end)
        for interval in self.starts.irange([start, 0], [end, 0], (True, False)):
            interval[1] += 1
            self.res = max(self.res, interval[1])
        return self.res