closest-room

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

There is a hotel with <code>n</code> rooms. The rooms are represented by a 2D integer array <code>rooms</code> where <code>rooms[i] = [roomIdi, sizei]</code> denotes that there is a room with room number <code>roomIdi</code> and size equal to <code>sizei</code>. Each <code>roomIdi</code> is guaranteed to be unique.

You are also given <code>k</code> queries in a 2D array <code>queries</code> where <code>queries[j] = [preferredj, minSizej]</code>. The answer to the <code>jth</code> query is the room number <code>id</code> of a room such that:

<ul>
	<li>The room has a size of at least <code>minSizej</code>, and</li>
	<li><code>abs(id - preferredj)</code> is minimized, where <code>abs(x)</code> is the absolute value of <code>x</code>.</li>
</ul>

If there is a tie in the absolute difference, then use the room with the smallest such <code>id</code>. If there is no such room, the answer is <code>-1</code>.

Return an array <code>answer</code> of length <code>k</code> where <code>answer[j]</code> contains the answer to the <code>jth</code> query.

&nbsp;
Example 1:

<pre>
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.</pre>

Example 2:

<pre>
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.</pre>

&nbsp;
Constraints:

<ul>
	<li><code>n == rooms.length</code></li>
	<li><code>1 &lt;= n &lt;= 105</code></li>
	<li><code>k == queries.length</code></li>
	<li><code>1 &lt;= k &lt;= 104</code></li>
	<li><code>1 &lt;= roomIdi, preferredj &lt;= 107</code></li>
	<li><code>1 &lt;= sizei, minSizej &lt;= 107</code></li>
</ul>

closestRoom

Closest Room

Most Beautiful Item for Each Query

most-beautiful-item-for-each-query

每一个查询的最大美丽值

Minimum Time to Kill All Monsters

minimum-time-to-kill-all-monsters

杀死所有怪物的最短时间

Array

Binary Search

Ordered Set

Sorting

一个酒店里有 <code>n</code> 个房间，这些房间用二维整数数组 <code>rooms</code> 表示，其中 <code>rooms[i] = [roomIdi, sizei]</code> 表示有一个房间号为 <code>roomIdi</code> 的房间且它的面积为 <code>sizei</code> 。每一个房间号 <code>roomIdi</code> 保证是 独一无二 的。

同时给你 <code>k</code> 个查询，用二维数组 <code>queries</code> 表示，其中 <code>queries[j] = [preferredj, minSizej]</code> 。第 <code>j</code> 个查询的答案是满足如下条件的房间 <code>id</code> ：

<ul>
	<li>房间的面积 至少 为 <code>minSizej</code> ，且</li>
	<li><code>abs(id - preferredj)</code> 的值 最小 ，其中 <code>abs(x)</code> 是 <code>x</code> 的绝对值。</li>
</ul>

如果差的绝对值有 相等 的，选择 最小 的 <code>id</code> 。如果 没有满足条件的房间 ，答案为 <code>-1</code> 。

请你返回长度为 <code>k</code> 的数组 <code>answer</code> ，其中 <code>answer[j]</code> 为第 <code>j</code> 个查询的结果。

 

示例 1：

<pre>
输入：rooms = [[2,2],[1,2],[3,2]], queries = [[3,1],[3,3],[5,2]]
输出：[3,-1,3]
解释：查询的答案如下：
查询 [3,1] ：房间 3 的面积为 2 ，大于等于 1 ，且号码是最接近 3 的，为 abs(3 - 3) = 0 ，所以答案为 3 。
查询 [3,3] ：没有房间的面积至少为 3 ，所以答案为 -1 。
查询 [5,2] ：房间 3 的面积为 2 ，大于等于 2 ，且号码是最接近 5 的，为 abs(3 - 5) = 2 ，所以答案为 3 。</pre>

示例 2：

<pre>
输入：rooms = [[1,4],[2,3],[3,5],[4,1],[5,2]], queries = [[2,3],[2,4],[2,5]]
输出：[2,1,3]
解释：查询的答案如下：
查询 [2,3] ：房间 2 的面积为 3 ，大于等于 3 ，且号码是最接近的，为 abs(2 - 2) = 0 ，所以答案为 2 。
查询 [2,4] ：房间 1 和 3 的面积都至少为 4 ，答案为 1 因为它房间编号更小。
查询 [2,5] ：房间 3 是唯一面积大于等于 5 的，所以答案为 3 。</pre>

 

提示：

<ul>
	<li><code>n == rooms.length</code></li>
	<li><code>1 <= n <= 105</code></li>
	<li><code>k == queries.length</code></li>
	<li><code>1 <= k <= 104</code></li>
	<li><code>1 <= roomIdi, preferredj <= 107</code></li>
	<li><code>1 <= sizei, minSizej <= 107</code></li>
</ul>