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

class Solution {
    int all=0;
    public int sumNumbers(TreeNode root) {
        subfunc(root,0);
        return all;

    }
    // 用于对all进行变化不用return，子函数要加一个参数sum，左右子树递归需要（父节点的sum）这个参数
    void subfunc(TreeNode root,int sum){
        if(root==null){
            return ;
        }
        sum=sum*10+root.val;
        if(root.left==null&&root.right==null){
            all+=sum;
        }
        subfunc(root.left,sum);
        subfunc(root.right,sum);
    }
}