129. Sum Root to Leaf Numbers

[问题链接]（https://leetcode.com/problems/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.

Note: A leaf is a node with no children.

Example:

Input: [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]

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.

解题思路：

深度优先遍历每一层的节点，改变每个节点的val，使其成为到根节点路径所含的数字的真实值，最后将所有叶子节点的值加起来。

class Solution {
    int sum = 0;
    public int sumNumbers(TreeNode root) {
        if(root == null) return 0;
        help(root);
        return sum;
    }
    private void help(TreeNode root)
    {
      
        if(root.left != null) 
        {
            root.left.val += root.val*10; 
            help(root.left);
        }
        if(root.right != null)
        {
            root.right.val += root.val*10;
            help(root.right);
        }
        if(root.left == null && root.right == null)
        {
            sum += root.val;
        }
    }
}