题目:原题链接(中等)
标签:设计、堆
解法 | 时间复杂度 | 空间复杂度 | 执行用时 |
Ans 1 (Python) | 668ms (33.42%) | ||
Ans 2 (Python) | |||
Ans 3 (Python) |
解法一:
class SeatManager:
def __init__(self, n: int):
self.lst = [i + 1 for i in range(n)]
self.unseat = set()
def reserve(self) -> int:
return heapq.heappop(self.lst)
def unreserve(self, seatNumber: int) -> None:
heapq.heappush(self.lst, seatNumber)