#1847
Closest Room
master · 1675 · lc hard +32 · failed · 41.1% accepted · 537 likes · top 21%
Description
A hotel has n rooms described by rooms[i] = [roomIdi, sizei] (all room IDs are distinct).
For each of k queries queries[j] = [preferredj, minSizej], find the room that has sizei >= minSizej and minimizes abs(id - preferredj). If two rooms tie, pick the smaller ID. If no valid room exists, return -1.
Return an array answer of length k with the results.
Example 1:
Input: rooms = [[2,2],[1,2],[3,2]], queries = [[3,1],[3,3],[5,2]]
Output: [3,-1,3]
Explanation: The answers to the queries are as follows:
Query = [3,1]: Room number 3 is the closest as abs(3 - 3) = 0, and its size of 2 is at least 1. The answer is 3.
Query = [3,3]: There are no rooms with a size of at least 3, so the answer is -1.
Query = [5,2]: Room number 3 is the closest as abs(3 - 5) = 2, and its size of 2 is at least 2. The answer is 3.
Example 2:
Input: rooms = [[1,4],[2,3],[3,5],[4,1],[5,2]], queries = [[2,3],[2,4],[2,5]]
Output: [2,1,3]
Explanation: The answers to the queries are as follows:
Query = [2,3]: Room number 2 is the closest as abs(2 - 2) = 0, and its size of 3 is at least 3. The answer is 2.
Query = [2,4]: Room numbers 1 and 3 both have sizes of at least 4. The answer is 1 since it is smaller.
Query = [2,5]: Room number 3 is the only room with a size of at least 5. The answer is 3.
Code
1
2
3