We have a list of points on the plane. Find the K closest points to the origin (0, 0).

(Here, the distance between two points on a plane is the Euclidean distance.)

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

Example 1:

Input: points= [[1,3],[-2,2]], K=1Output: [[-2,2]] Explanation: Thedistancebetween (1, 3) andtheoriginissqrt(10). Thedistancebetween (-2, 2) andtheoriginissqrt(8). Sincesqrt(8) <sqrt(10), (-2, 2) isclosertotheorigin. WeonlywanttheclosestK=1pointsfromtheorigin, sotheanswerisjust [[-2,2]].

Example 2:

Input: points= [[3,3],[5,-1],[-2,4]], K=2Output: [[3,3],[-2,4]] (Theanswer [[-2,4],[3,3]] wouldalsobeaccepted.)

Note:

• 1 <= K <= points.length <= 10000
• -10000 < points[i][0] < 10000
• -10000 < points[i][1] < 10000

找出 K 个距离坐标原点最近的坐标点。

这题也是排序题，先将所有点距离坐标原点的距离都算出来，然后从小到大排序。取前 K 个即可。