#1845

Seat Reservation Manager

specialist · 605 · lc medium +29 · 67.1% accepted · 1,477 likes · top 73%

Description

Design a seat reservation manager for n seats numbered 1 through n.

Implement the SeatManager class:

- SeatManager(int n) — Initializes with all n seats available.

- int reserve() — Reserves and returns the smallest-numbered available seat.

- void unreserve(int seatNumber) — Makes the given seat available again.

Example 1:

Input
["SeatManager", "reserve", "reserve", "unreserve", "reserve", "reserve", "reserve", "reserve", "unreserve"]
[[5], [], [], [2], [], [], [], [], [5]]
Output
[null, 1, 2, null, 2, 3, 4, 5, null]

Example 2:

Explanation
SeatManager seatManager = new SeatManager(5); // Initializes a SeatManager with 5 seats.
seatManager.reserve(); // All seats are available, so return the lowest numbered seat, which is 1.
seatManager.reserve(); // The available seats are [2,3,4,5], so return the lowest of them, which is 2.
seatManager.unreserve(2); // Unreserve seat 2, so now the available seats are [2,3,4,5].
seatManager.reserve(); // The available seats are [2,3,4,5], so return the lowest of them, which is 2.
seatManager.reserve(); // The available seats are [3,4,5], so return the lowest of them, which is 3.
seatManager.reserve(); // The available seats are [4,5], so return the lowest of them, which is 4.
seatManager.reserve(); // The only available seat is seat 5, so return 5.
seatManager.unreserve(5); // Unreserve seat 5, so now the available seats are [5].

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16