deno.land / x / masx200_leetcode_test@10.6.5 / find-elements-in-a-contaminated-binary-tree / index.ts

نووسراو ببینە
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
class FindElements { #root: TreeNode | null; #values = new Set<number>(); constructor(root: TreeNode | null) { this.#root = root; if (root) { root.val = 0; const nodes = [root]; while (nodes.length) { const node = nodes[nodes.length - 1]; nodes.pop(); const value = node.val; this.#values.add(value); if (node.left) { node.left.val = 2 * node.val + 1; nodes.push(node.left); } if (node.right) { node.right.val = 2 * node.val + 2; nodes.push(node.right); } } } }
find(target: number): boolean { if (!this.#root) return false; return this.#values.has(target); }}export default FindElements;
masx200_leetcode_test
leetcode题解和一些测试工具
DocumentationDocumentation
GitHub Repositorymasx200/leetcode-test
GitHub Stars
4

Version Info

Tagged at
4 months ago