[LeetCode129] 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.
思路：
深度优先
用sum来记录路径值

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