feat: add 3rd ts solution to lc problem: No.0973

Author: rain84

solution/0900-0999/0973.K Closest Points to Origin/README.md

@@ -177,4 +177,50 @@ function kClosest(points: number[][], k: number): number[][] {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 3. Binary search
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function kClosest(points: number[][], k: number): number[][] {
+    if (k === points.length) return points;
+
+    const distance = points.map(([x, y]) => x ** 2 + y ** 2);
+    let indexes = points.map((_, i) => i);
+    let [l, r] = [0, Math.max(...distance)];
+    const res: number[] = [];
+
+    while (k) {
+        const mid = (l + r) >> 1;
+
+        const closer: number[] = [];
+        const farther: number[] = [];
+        for (const i of indexes) {
+            if (distance[i] <= mid) closer.push(i);
+            else farther.push(i);
+        }
+
+        if (closer.length > k) {
+            r = mid;
+            indexes = closer;
+        } else {
+            l = mid;
+            k -= closer.length;
+            res.push(...closer);
+            indexes = farther;
+        }
+    }
+
+    return res.map(i => points[i]);
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/0900-0999/0973.K Closest Points to Origin/README_EN.md

@@ -170,3 +170,51 @@ function kClosest(points: number[][], k: number): number[][] {
 <!-- solution:end -->
 
 <!-- problem:end -->
+
+<!-- solution:start -->
+
+### Solution 3. Binary search
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function kClosest(points: number[][], k: number): number[][] {
+    if (k === points.length) return points;
+
+    const distance = points.map(([x, y]) => x ** 2 + y ** 2);
+    let indexes = points.map((_, i) => i);
+    let [l, r] = [0, Math.max(...distance)];
+    const res: number[] = [];
+
+    while (k) {
+        const mid = (l + r) >> 1;
+
+        const closer: number[] = [];
+        const farther: number[] = [];
+        for (const i of indexes) {
+            if (distance[i] <= mid) closer.push(i);
+            else farther.push(i);
+        }
+
+        if (closer.length > k) {
+            r = mid;
+            indexes = closer;
+        } else {
+            l = mid;
+            k -= closer.length;
+            res.push(...closer);
+            indexes = farther;
+        }
+    }
+
+    return res.map(i => points[i]);
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- problem:end -->

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

@@ -0,0 +1,31 @@
+function kClosest(points: number[][], k: number): number[][] {
+    if (k === points.length) return points;
+
+    const distance = points.map(([x, y]) => x ** 2 + y ** 2);
+    let indexes = points.map((_, i) => i);
+    let [l, r] = [0, Math.max(...distance)];
+    const res: number[] = [];
+
+    while (k) {
+        const mid = (l + r) >> 1;
+
+        const closer: number[] = [];
+        const farther: number[] = [];
+        for (const i of indexes) {
+            if (distance[i] <= mid) closer.push(i);
+            else farther.push(i);
+        }
+
+        if (closer.length > k) {
+            r = mid;
+            indexes = closer;
+        } else {
+            l = mid;
+            k -= closer.length;
+            res.push(...closer);
+            indexes = farther;
+        }
+    }
+
+    return res.map(i => points[i]);
+}