leetcode 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 number123.

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并且加上当前节点传入下一函数，进行递归，最终把左右子树的总和相加。结束条件的话就是如果一个节点是叶子。

代码AC：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int sumNumbers(TreeNode root) {
        
         return sumNumbers(root,0);
    }
    
     public int sumNumbers(TreeNode root, int subSum){
		  if(root == null)
			  return 0;
		  if(root.left == null && root.right == null)
			  return subSum * 10 + root.val;
		  return sumNumbers(root.left, subSum*10+root.val) + sumNumbers(root.right, subSum*10+root.val);
	 }
}