LeetCode 129. 求根节点到叶节点数字之和-CSDN博客

本文链接：https://blog.csdn.net/weixin_41822929/article/details/140643125

有全局变量：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int num = 0;
    int res = 0;

    void dfs(TreeNode* tNode){
        if(!tNode){
            return;
        }else if(!tNode->left && !tNode->right){
            res += num * 10 + tNode->val;
        }else{
            num = num * 10 + tNode->val;
            dfs(tNode->left);
            dfs(tNode->right);
            num /= 10;
        }
    }
    int sumNumbers(TreeNode* root) {
        dfs(root);
        return res;
    }
};

无全局变量：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:

    int dfs(TreeNode* tNode, int preSum){
        if(!tNode){ //左子树或右子树有一个为空的那个空节点
            return 0;
        }
        int sum = preSum * 10 + tNode->val;
        if(!tNode->left && !tNode->right){
            return sum;
        }else{
            return dfs(tNode->left, sum) + dfs(tNode->right, sum);
        }
    }
    int sumNumbers(TreeNode* root) {
        return dfs(root, 0);
    }
};