129. 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 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.

题目含义：根节点到叶子节点的元素依次从高到地位构成一个整数，求所有整数的和

 1     private int sums(TreeNode root,int sum) {
 2         if (root ==null) return 0;
 3         sum = sum*10 + root.val;
 4         if (root.left == null && root.right==null) return sum;
 5         return  sums(root.left,sum) + sums(root.right,sum);
 6     }
 7     
 8     public int sumNumbers(TreeNode root) {
 9         return sums(root,0);
10     }

 

 

 

 

 
posted @ 2017-10-22 21:23  daniel456  阅读(98)  评论(0)  编辑  收藏  举报