find-k-closest-elements

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given a sorted 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.

An integer <code>a</code> is closer to <code>x</code> than an integer <code>b</code> if:

<ul>
	<li><code>|a - x| &lt; |b - x|</code>, or</li>
	<li><code>|a - x| == |b - x|</code> and <code>a &lt; b</code></li>
</ul>

&nbsp;
Example 1:

<div class="example-block">
Input: arr = [1,2,3,4,5], k = 4, x = 3

Output: [1,2,3,4]
</div>

Example 2:

<div class="example-block">
Input: arr = [1,1,2,3,4,5], k = 4, x = -1

Output: [1,1,2,3]
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= k &lt;= arr.length</code></li>
	<li><code>1 &lt;= arr.length &lt;= 104</code></li>
	<li><code>arr</code> is sorted in ascending order.</li>
	<li><code>-104 &lt;= arr[i], x &lt;= 104</code></li>
</ul>