mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
27 lines
1.1 KiB
HTML
27 lines
1.1 KiB
HTML
<p>Given a <strong>sorted</strong> integer array <code>arr</code>, two integers <code>k</code> and <code>x</code>, return the <code>k</code> closest integers to <code>x</code> in the array. The result should also be sorted in ascending order.</p>
|
|
|
|
<p>An integer <code>a</code> is closer to <code>x</code> than an integer <code>b</code> if:</p>
|
|
|
|
<ul>
|
|
<li><code>|a - x| < |b - x|</code>, or</li>
|
|
<li><code>|a - x| == |b - x|</code> and <code>a < b</code></li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
<pre><strong>Input:</strong> arr = [1,2,3,4,5], k = 4, x = 3
|
|
<strong>Output:</strong> [1,2,3,4]
|
|
</pre><p><strong class="example">Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> arr = [1,2,3,4,5], k = 4, x = -1
|
|
<strong>Output:</strong> [1,2,3,4]
|
|
</pre>
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= k <= arr.length</code></li>
|
|
<li><code>1 <= arr.length <= 10<sup>4</sup></code></li>
|
|
<li><code>arr</code> is sorted in <strong>ascending</strong> order.</li>
|
|
<li><code>-10<sup>4</sup> <= arr[i], x <= 10<sup>4</sup></code></li>
|
|
</ul>
|