https://leetcode.cn/problems/find-k-closest-elements/ https://leetcode.cn/problems/k-closest-points-to-origin/

Author: masx200

README.md

@@ -10,6 +10,10 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/find-k-closest-elements/
+
+https://leetcode.cn/problems/k-closest-points-to-origin/
+
 https://leetcode.cn/problems/make-two-arrays-equal-by-reversing-sub-arrays/
 
 https://leetcode.cn/problems/transform-to-chessboard/

find-k-closest-elements/index.ts

@@ -0,0 +1,28 @@
+export default function findClosestElements(
+    arr: number[],
+    k: number,
+    x: number,
+): number[] {
+    const size = (arr).length;
+    let left = 0;
+    let right = size - k;
+
+    while (left < right) {
+        const mid = Math.floor(
+            (left + right) / 2,
+        );
+        //  # 尝试从长度为 k + 1 的连续子区间删除一个元素
+        // # 从而定位左区间端点的边界值
+
+        //x大于左右端点的平均值
+        if (2 * x > arr[mid] + arr[mid + k]) {
+            //右移
+            left = mid + 1;
+        } else {
+            //左移
+            right = mid;
+        }
+    }
+
+    return arr.slice(left, left + k);
+}

k-closest-points-to-origin/index.ts

@@ -0,0 +1,4 @@
+export default function kClosest(points: number[][], k: number): number[][] {
+    return points.sort((a, b) => a[0] ** 2 + a[1] ** 2 - b[0] ** 2 - b[1] ** 2)
+        .slice(0, k);
+}