mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 11:08:15 +08:00
36 lines
1.1 KiB
HTML
36 lines
1.1 KiB
HTML
|
<p>给定一个 <strong>排序好</strong> 的数组 <code>arr</code> ，两个整数 <code>k</code> 和 <code>x</code> ，从数组中找到最靠近 <code>x</code>（两数之差最小）的 <code>k</code> 个数。返回的结果必须要是按升序排好的。</p>
|
|||
|
|
|
|||
|
|
<p>整数 <code>a</code> 比整数 <code>b</code> 更接近 <code>x</code> 需要满足：</p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>|a - x| < |b - x|</code> 或者</li>
|
|||
|
|
<li><code>|a - x| == |b - x|</code> 且 <code>a < b</code></li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>arr = [1,2,3,4,5], k = 4, x = 3
|
|||
|
|
<strong>输出：</strong>[1,2,3,4]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>arr = [1,2,3,4,5], k = 4, x = -1
|
|||
|
|
<strong>输出：</strong>[1,2,3,4]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= k <= arr.length</code></li>
|
|||
|
|
<li><code>1 <= arr.length <= 10<sup>4</sup></code><meta charset="UTF-8" /></li>
|
|||
|
|
<li><code>arr</code> 按 <strong>升序</strong> 排列</li>
|
|||
|
|
<li><code>-10<sup>4</sup> <= arr[i], x <= 10<sup>4</sup></code></li>
|
|||
|
|
</ul>
|