leetcode129——Sum Root to Leaf Numbers

题目：每个节点存放一个0-9的数字，每条从根到叶子节点的路径都代表一个数字，求根到叶子节点生成的所有数字之和。

代码：以下两种方式都行

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int sumNumbers(TreeNode* root) {
        if(root == NULL) return 0;
        return dfs(root,0,0);
    }
    int dfs(TreeNode* root,int tmp,int sum){
        tmp = tmp * 10 + root->val;
        if(root->left == NULL && root->right == NULL){
            sum += tmp;
            return sum;
        }
        if(root->left && root->right) 
            return dfs(root->left,tmp,sum) + dfs(root->right,tmp,sum);
        else if(root->left) return dfs(root->left,tmp,sum);
        else return dfs(root->right,tmp,sum);
    }
};

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