首页 > 代码库 > [leetcode]Sum Root to Leaf Numbers
[leetcode]Sum Root to Leaf Numbers
问题描述:
Given a binary tree containing digits from 0-9
only, each root-to-leaf path could represent a number.
An example is the root-to-leaf path 1->2->3
which represents the number123
.
Find the total sum of all root-to-leaf numbers.
For example,
1 / 2 3
The root-to-leaf path 1->2
represents the number 12
.
The root-to-leaf path 1->3
represents the number 13
.
Return the sum = 12 + 13 = 25
.
代码:
public int sumNumbers(TreeNode root) { //Java if (root == null) return 0; return sumR(root, 0); } public int sumR(TreeNode root, int x) { if (root.right == null && root.left == null) return 10 * x + root.val; int val = 0; if (root.left != null) val += sumR(root.left, 10 * x + root.val); if (root.right != null) val += sumR(root.right, 10 * x + root.val); return val; }
[leetcode]Sum Root to Leaf Numbers
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。