94_leetcode_Path Sum

最新推荐文章于 2024-11-01 15:19:21 发布

ezzffzz

最新推荐文章于 2024-11-01 15:19:21 发布

阅读量338

点赞数

分类专栏：编程 leetcode 算法文章标签： leetcode 算法编程语言

本文链接：https://blog.csdn.net/ezzffzz/article/details/33678845

版权

编程同时被 3 个专栏收录

155 篇文章 0 订阅

订阅专栏

leetcode

155 篇文章 0 订阅

订阅专栏

算法

155 篇文章 0 订阅

订阅专栏

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:
Given the below binary tree and sum = 22 ,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \      \
        7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22

1:先序遍历；2:对于访问的每一个节点判断是不是叶节点，判断当前的值是不是target；

    bool hasPathSum(TreeNode *root, int sum)
    {
        if(root == NULL)
        {
            return false;
        }
        
        int leftValue = sum;
        
        return hasPathSumCore(root, leftValue);
    }
    
    bool hasPathSumCore(TreeNode *root, int &leftValue)
    {
        leftValue -= root->val;
        
        bool result = false;
        
        if(leftValue == 0)
        {
            if(root->left == NULL && root->right == NULL)
            {
                result = true;
            }
        }
        
        if(root->left)
        {
            result = hasPathSumCore(root->left, leftValue);
        }
        
        if(!result && root->right)
        {
            result = hasPathSumCore(root->right, leftValue);
        }
        
        leftValue += root->val;
        return result;
    }