[99클럽] 37일차 TIL

https://leetcode.com/problems/seat-reservation-manager/submissions/1300708018/

 

heap의 기본적인 동작을 나타내는 문제입니다.

 

from collections import deque

class SeatManager:

    def __init__(self, n: int):
        self.min_heapq = [i for i in range(1, n + 1)]

    def reserve(self) -> int:
        return heapq.heappop(self.min_heapq)

    def unreserve(self, seatNumber: int) -> None:
        heapq.heappush(self.min_heapq, seatNumber)