1845. Seat Reservation Manager

문제

https://leetcode.com/problems/seat-reservation-manager/description/

풀이

class SeatManager {
    PriorityQueue<Integer> seat = new PriorityQueue<>();
    public SeatManager(int n) {
        for(int i = 1; i <= n; i++) {
            seat.add(i);
        }
    }
    
    public int reserve() {
        return seat.poll();
    }
    
    public void unreserve(int seatNumber) {
        seat.add(seatNumber);
    }
}

• 가장 작은 수를 반복해서 꺼내기 -> min-heap 사용