# 2 原题

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.



# 3 AC解

/**
* Definition for a binary tree node.
* public class TreeNode {
*     int val;
*     TreeNode left;
*     TreeNode right;
*     TreeNode(int x) { val = x; }
* }
*/

/**
* 直接遍历就好，老方法
* */
public class Solution {
int total=0;
public void dfs(TreeNode root,int value){
if(root.left==null && root.right==null){ //leaf
total+=value;
}
if(root.left!=null)
dfs(root.left,value*10+root.left.val);
if(root.right!=null)
dfs(root.right,value*10+root.right.val);
}
public int sumNumbers(TreeNode root) {
if(root!=null){
dfs(root,root.val);
}
}
}

#### 【LeetCode-面试算法经典-Java实现】【129-Sum Root to Leaf Numbers（所有根到叶子结点组组成的数字相加）】

2015-08-15 06:11:18

#### Sum Root to Leaf Numbers -- LeetCode

2014-04-04 09:20:44

#### LeetCode 129:Sum Root to Leaf Numbers

2015-12-31 14:30:09

#### leetcode Sum Root to Leaf Numbers 详细思考分析过程

2013-11-03 09:15:06

#### 【LeetCode】Sum Root to Leaf Numbers 解题报告

2014-09-22 17:14:49

#### Sum Root to Leaf Numbers -- leetcode

2015-05-24 08:49:26

#### [LeetCode 129] Sum Root to Leaf Numbers

2015-03-22 22:36:33

#### LeetCode 129 Sum Root to Leaf Numbers（递归求和）

2017-07-12 20:04:54

#### [Leetcode] 129. Sum Root to Leaf Numbers 解题报告

2017-05-03 11:19:19