Create Solution3.java

Author: yanglbme

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

@@ -0,0 +1,34 @@
+class Solution {
+    public int[][] kClosest(int[][] points, int k) {
+        int n = points.length;
+        int[] dist = new int[n];
+        int r = 0;
+        for (int i = 0; i < n; ++i) {
+            int x = points[i][0], y = points[i][1];
+            dist[i] = x * x + y * y;
+            r = Math.max(r, dist[i]);
+        }
+        int l = 0;
+        while (l < r) {
+            int mid = (l + r) >> 1;
+            int cnt = 0;
+            for (int d : dist) {
+                if (d <= mid) {
+                    ++cnt;
+                }
+            }
+            if (cnt >= k) {
+                r = mid;
+            } else {
+                l = mid + 1;
+            }
+        }
+        int[][] ans = new int[k][0];
+        for (int i = 0, j = 0; i < n; ++i) {
+            if (dist[i] <= l) {
+                ans[j++] = points[i];
+            }
+        }
+        return ans;
+    }
+}