leetcode刷题_OJ 129

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.

Note: A leaf is a node with no children.

Example:

Input: [1,2,3]
    1
   / \
  2   3
Output: 25
Explanation:
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Therefore, sum = 12 + 13 = 25.
Example 2:

Input: [4,9,0,5,1]
    4
   / \
  9   0
 / \
5   1
Output: 1026
Explanation:
The root-to-leaf path 4->9->5 represents the number 495.
The root-to-leaf path 4->9->1 represents the number 491.
The root-to-leaf path 4->0 represents the number 40.
Therefore, sum = 495 + 491 + 40 = 1026.

题目的意思：根据所给序列构造一颗二叉树，然后从每个叶子节点开始向上直到根节点以此来得到一个数字，将每个数字的结果相加输出即为答案。

简单的思路：采用递归，直到遍历到叶子节点，否则将先前节点的和乘以10再加上现在正在遍历的节点的值。

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

    private int Sum(TreeNode r,int temp){
        if (r == null) {//节点为空
            return 0;
        }
        if(r.left == null && r.right == null){//遍历到了叶子节点
            return temp*10+r.val;
        }
        return Sum(r.left,temp*10+r.val)+Sum(r.right,temp*10+r.val);
    }

}