Create Solution2.java

Author: yanglbme

solution/0900-0999/0973.K Closest Points to Origin/Solution2.java

@@ -0,0 +1,17 @@
+class Solution {
+    public int[][] kClosest(int[][] points, int k) {
+        PriorityQueue<int[]> maxQ = new PriorityQueue<>((a, b) -> b[0] - a[0]);
+        for (int i = 0; i < points.length; ++i) {
+            int x = points[i][0], y = points[i][1];
+            maxQ.offer(new int[] {x * x + y * y, i});
+            if (maxQ.size() > k) {
+                maxQ.poll();
+            }
+        }
+        int[][] ans = new int[k][2];
+        for (int i = 0; i < k; ++i) {
+            ans[i] = points[maxQ.poll()[1]];
+        }
+        return ans;
+    }
+}