Add Java solution for day30: K Closest Points to Origin

qilingit · qilingit · commit 99e14f23edc5 · 2020-05-31T00:11:57.000+02:00
diff --git a/May-LeetCoding-Challenge/30-K-Closest-Points-To-Origin/K-Closest-Points-To-Origin.java b/May-LeetCoding-Challenge/30-K-Closest-Points-To-Origin/K-Closest-Points-To-Origin.java
@@ -0,0 +1,17 @@
+class Solution {
+    public int[][] kClosest(int[][] points, int K) {
+        int[][] res = new int[K][2];
+        PriorityQueue<int[]> minHeap = new PriorityQueue<>
+            ((a, b) -> (a[0]*a[0] + a[1]*a[1]) - (b[0]*b[0] + b[1]*b[1]));
+        
+        for (int[] point : points) {
+            minHeap.add(point);
+        }
+
+        for (int i = 0; i < K; i++) {
+            res[i] = minHeap.poll();
+
+        }
+        return res;
+    }
+}
