https://leetcode.cn/problems/smallest-difference-lcci/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/smallest-difference-lcci/
+
 https://leetcode.cn/problems/queue-reconstruction-by-height/
 
 https://leetcode.cn/problems/design-file-system/

queue-reconstruction-by-height/index.ts

@@ -1,15 +1,15 @@
-export default function reconstructQueue(people: number[][]): number[][] {
-    const queue: number[][] = [];
-    people.sort((a, b) => {
-        if (b[0] !== a[0]) {
-            return b[0] - a[0];
-        } else {
-            return a[1] - b[1];
-        }
-    });
-
-    for (let i = 0; i < people.length; i++) {
-        queue.splice(people[i][1], 0, people[i]);
-    }
-    return queue;
-}
+export default function reconstructQueue(people: number[][]): number[][] {
+    const queue: number[][] = [];
+    people.sort((a, b) => {
+        if (b[0] !== a[0]) {
+            return b[0] - a[0];
+        } else {
+            return a[1] - b[1];
+        }
+    });
+
+    for (let i = 0; i < people.length; i++) {
+        queue.splice(people[i][1], 0, people[i]);
+    }
+    return queue;
+}

smallest-difference-lcci/index.ts

@@ -0,0 +1,13 @@
+export default function smallestDifference(a: number[], b: number[]): number {
+    return Math.min(
+        2147483647,
+        ...[
+            ...a.sort((x, y) => x - y).map((v) => [v, 1]),
+            ...b.sort((x, y) => x - y).map((v) => [v, 0]),
+        ].sort((a, b) => a[0] - b[0]).map((v, i, a) =>
+            i === 0 || v[1] === a[i - 1][1]
+                ? 2147483647
+                : Math.abs(v[0] - a[i - 1][0])
+        ).filter((a) => a < 2147483647),
+    );
+}