We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Difficulty: 中等
Related Topics: 树, 深度优先搜索, 二叉树
给你一个二叉树的根节点 root ,树中每个节点都存放有一个 0 到 9 之间的数字。
root
0
9
每条从根节点到叶节点的路径都代表一个数字:
1 -> 2 -> 3
123
计算从根节点到叶节点生成的 所有数字之和 。
叶节点 是指没有子节点的节点。
示例 1:
输入:root = [1,2,3] 输出:25 解释: 从根到叶子节点路径 1->2 代表数字 12 从根到叶子节点路径 1->3 代表数字 13 因此,数字总和 = 12 + 13 = 25
示例 2:
输入:root = [4,9,0,5,1] 输出:1026 解释: 从根到叶子节点路径 4->9->5 代表数字 495 从根到叶子节点路径 4->9->1 代表数字 491 从根到叶子节点路径 4->0 代表数字 40 因此,数字总和 = 495 + 491 + 40 = 1026
提示:
[1, 1000]
0 <= Node.val <= 9
10
Language: JavaScript
/** * Definition for a binary tree node. * function TreeNode(val, left, right) { * this.val = (val===undefined ? 0 : val) * this.left = (left===undefined ? null : left) * this.right = (right===undefined ? null : right) * } */ /** * @param {TreeNode} root * @return {number} */ // 深度优先搜索 var sumNumbers = function(root) { const dfs = (root, prevSum) => { if (!root) return 0 const sum = prevSum * 10 + root.val if (root.left === null && root.right === null) { return sum } else { return dfs(root.left, sum) + dfs(root.right, sum) } } return dfs(root, 0) };
The text was updated successfully, but these errors were encountered:
No branches or pull requests
129. 求根节点到叶节点数字之和
Description
Difficulty: 中等
Related Topics: 树, 深度优先搜索, 二叉树
给你一个二叉树的根节点
root
,树中每个节点都存放有一个0
到9
之间的数字。每条从根节点到叶节点的路径都代表一个数字:
1 -> 2 -> 3
表示数字123
。计算从根节点到叶节点生成的 所有数字之和 。
叶节点 是指没有子节点的节点。
示例 1:
示例 2:
提示:
[1, 1000]
内0 <= Node.val <= 9
10
Solution
Language: JavaScript
The text was updated successfully, but these errors were encountered: