https://leetcode.cn/problems/sequence-reconstruction/ https://leetcode.cn/problems/ur2n8P/

Author: masx200

README.md

@@ -896,6 +896,10 @@ https://leetcode.cn/problems/cells-with-odd-values-in-a-matrix/
 
 https://leetcode.cn/problems/set-intersection-size-at-least-two
 
+https://leetcode.cn/problems/sequence-reconstruction/
+
+https://leetcode.cn/problems/ur2n8P/
+
 #### 安装教程
 
 1. 安装`deno`

sequence-reconstruction/index.ts

@@ -0,0 +1,3 @@
+import sequenceReconstruction from "../ur2n8P/index.ts";
+
+export default sequenceReconstruction;

ur2n8P/index.ts

@@ -0,0 +1,22 @@
+function sequenceReconstruction(
+    nums: number[],
+    sequences: number[][],
+): boolean {
+    const s = new Set<string>();
+    for (const seq of sequences) {
+        for (let i = 0; i < seq.length - 1; i++) {
+            s.add(hash(seq[i], seq[i + 1]));
+        }
+    }
+    for (let i = 0; i < nums.length - 1; i++) {
+        if (!s.has(hash(nums[i], nums[i + 1]))) {
+            return false;
+        }
+    }
+    return true;
+}
+
+function hash(arg0: number, arg1: number): string {
+    return JSON.stringify([arg0, arg1]);
+}
+export default sequenceReconstruction;