LeetCode || Sum Root to Leaf Numbers

最新推荐文章于 2023-10-10 09:42:58 发布

xuxumoi

最新推荐文章于 2023-10-10 09:42:58 发布

阅读量298

点赞数

本文链接：https://blog.csdn.net/xsloop/article/details/47133527

版权

LeetCode 专栏收录该内容

107 篇文章 0 订阅

订阅专栏

Sum Root to Leaf Numbers

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