leetcode129. 求根到叶子节点数字之和

1、题目

https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/

2、题意

题解1:递归每次到底层更新结果

/**
 * 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 res = 0;
    void dfs(TreeNode* root,int num)
    {
        num = num*10+root->val;
        if(!root->left&&!root->right) res+=num;
        if(root->left) dfs(root->left,num);
        if(root->right) dfs(root->right,num);
    }
    int sumNumbers(TreeNode* root) {
        if(root) dfs(root,0);
        return res;
    }
};