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.
Note: A leaf is a node with no children.
Example:
Input: [1,2,3] 1 / \ 2 3 Output: 25 Explanation: The root-to-leaf path1->2
represents the number12
. The root-to-leaf path1->3
represents the number13
. Therefore, sum = 12 + 13 =25
.
Example 2:
Input: [4,9,0,5,1] 4 / \ 9 0 / \ 5 1 Output: 1026 Explanation: The root-to-leaf path4->9->5
represents the number 495. The root-to-leaf path4->9->1
represents the number 491. The root-to-leaf path4->0
represents the number 40. Therefore, sum = 495 + 491 + 40 =1026
.
该题考查了深度搜索算法,具体代码实现如下:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int sumNumbers(TreeNode root) {
if(root == null){
return 0;
}
if(root.left==null && root.right == null){
return root.val;
}
return sumNumbers(root,tmp);
}
public int sumNumbers(TreeNode root,int beforeValue) {
int left = 0;
int right = 0;
int tmp = beforeValue*10;
if(root.left==null && root.right == null){
return beforeValue;
}
if(root.left!=null){
left += sumNumbers(root.left,tmp+root.left.val);
}
if(root.right!=null){
right += sumNumbers(root.right,tmp+root.right.val);
}
return left+right;
}
}