|
2 | 2 |
|
3 | 3 | importjava.util.PriorityQueue; |
4 | 4 |
|
5 | | -/** |
6 | | - * 973. K Closest Points to Origin |
7 | | - * |
8 | | - * We have a list of points on the plane. Find the K closest points to the origin (0, 0). |
9 | | - * |
10 | | - * (Here, the distance between two points on a plane is the Euclidean distance.) |
11 | | - * |
12 | | - * You may return the answer in any order. The answer is guaranteed to be unique (except for the order that it is in.) |
13 | | - * |
14 | | - * |
15 | | - * |
16 | | - * Example 1: |
17 | | - * |
18 | | - * Input: points = [[1,3],[-2,2]], K = 1 |
19 | | - * Output: [[-2,2]] |
20 | | - * Explanation: |
21 | | - * The distance between (1, 3) and the origin is sqrt(10). |
22 | | - * The distance between (-2, 2) and the origin is sqrt(8). |
23 | | - * Since sqrt(8) < sqrt(10), (-2, 2) is closer to the origin. |
24 | | - * We only want the closest K = 1 points from the origin, so the answer is just [[-2,2]]. |
25 | | - * Example 2: |
26 | | - * |
27 | | - * Input: points = [[3,3],[5,-1],[-2,4]], K = 2 |
28 | | - * Output: [[3,3],[-2,4]] |
29 | | - * (The answer [[-2,4],[3,3]] would also be accepted.) |
30 | | - * |
31 | | - * |
32 | | - * Note: |
33 | | - * |
34 | | - * 1 <= K <= points.length <= 10000 |
35 | | - * -10000 < points[i][0] < 10000 |
36 | | - * -10000 < points[i][1] < 10000 |
37 | | - * */ |
38 | 5 | publicclass_973 { |
39 | 6 |
|
40 | 7 | publicstaticclassSolution1 { |
|