【LeetCode】Sum Root to Leaf Numbers

标签：tree

题目

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.

题目求将所有根到叶子的路径的组成的数字的和。每遍历一层后，数值会*10，所以可以考虑用递归的方法。参考了别人的，代码如下：

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int sumNumbers(TreeNode root) {
        if(root==null){
            return 0;
        }
        return sum(root,0);
    }
    
    private int sum(TreeNode root,int parentVal){
        if(root==null){
            return 0;
        }
        int sum=0;
        int temp=10*parentVal+root.val;
        if(root.left==null&&root.right==null){  //注意只有当节点为叶子节点时，才赋值给sum
            sum=temp;
        }
        if(root.left!=null){
            sum+=sum(root.left,temp);
        }
        if(root.right!=null){
            sum+=sum(root.right,temp);
        }
        return sum;
    }
}

---EOF---

【LeetCode】Sum Root to Leaf Numbers

标签：tree

原文地址：http://blog.csdn.net/navyifanr/article/details/42103101