k-closest-points-to-origin

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given an array of <code>points</code> where <code>points[i] = [xi, yi]</code> represents a point on the X-Y plane and an integer <code>k</code>, return the <code>k</code> closest points to the origin <code>(0, 0)</code>.

The distance between two points on the X-Y plane is the Euclidean distance (i.e., <code>&radic;(x1 - x2)2 + (y1 - y2)2</code>).

You may return the answer in any order. The answer is guaranteed to be unique (except for the order that it is in).

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/03/closestplane1.jpg" style="width: 400px; height: 400px;" />
<pre>
Input: points = [[1,3],[-2,2]], k = 1
Output: [[-2,2]]
Explanation:
The distance between (1, 3) and the origin is sqrt(10).
The distance between (-2, 2) and the origin is sqrt(8).
Since sqrt(8) &lt; sqrt(10), (-2, 2) is closer to the origin.
We only want the closest k = 1 points from the origin, so the answer is just [[-2,2]].
</pre>

Example 2:

<pre>
Input: points = [[3,3],[5,-1],[-2,4]], k = 2
Output: [[3,3],[-2,4]]
Explanation: The answer [[-2,4],[3,3]] would also be accepted.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= k &lt;= points.length &lt;= 104</code></li>
	<li><code>-104 &lt;= xi, yi &lt;= 104</code></li>
</ul>