deno.land / x / masx200_leetcode_test@10.6.5 / hPov7L / 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
import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
export default function largestValues(root: TreeNode | null): number[] { if (!root) return []; const current: TreeNode[] = [root]; const result: number[] = [];
level(current, (r) => result.push(r)); return result;}
function level(nodes: TreeNode[], output: (r: number) => void) { if (nodes.length === 0) return;
const values = nodes.map((n) => n.val); output(Math.max(...values));
level( nodes .map((n) => [n.left, n.right].filter(Boolean) as TreeNode[]) .flat(), output, );}
masx200_leetcode_test
leetcode题解和一些测试工具
DocumentationDocumentation
GitHub Repositorymasx200/leetcode-test
GitHub Stars
4

Version Info

Tagged at
4 months ago