树的深搜计数,记路径
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
int res = 0;
public int sumNumbers(TreeNode root) {
if(root==null) return res;
dfs(root,0);
return res;
}
void dfs(TreeNode root,int num){
if(root==null){
return ;
}
int sum = num*10 + root.val;
if(root.left==null&&root.right==null){
res += sum;
}else{
dfs(root.left,sum);
dfs(root.right,sum);
}
}
}