题目:
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 number 123
.
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
.
思路:
- 递归地,深度遍历二叉树
- 每行进到下一子节点,将上一节点算出的和sum乘以10再加上现在结点的值,即sum = sum*10 + node.val。表示前面所有的位都进了一位。
- lsum 表示,从node的左孩子出发,所有叶子节点的和;rsum类似;
- 当node为叶子节点时,返回sum值,否则返回lsum + rsum
注意点:
- 看清题目,是求所有叶子节点代表数字的和,而不是求叶子节点代表数字的最大值。。。
代码:
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int sumNumbers(TreeNode root) {
if (root == null){
return 0;
}
return calculateSum(root, 0);
}
static int calculateSum(TreeNode node, int sum){
int lsum = 0;
int rsum = 0;
sum = sum*10 + node.val;
if (node.left != null){
lsum = calculateSum(node.left, sum);
}
if (node.right != null){
rsum = calculateSum(node.right, sum);
}
//if node is a leave, return (sum), else return (lsum + rsum)
return (node.left != null || node.right != null) ? (lsum + rsum) : sum;
}
}