LeetCode PathSum

最新推荐文章于 2024-11-11 20:59:17 发布

songcy6202

最新推荐文章于 2024-11-11 20:59:17 发布

阅读量457

点赞数

分类专栏： c++ 文章标签： leetcode

本文链接：https://blog.csdn.net/songcy6202/article/details/28275559

版权

c++ 专栏收录该内容

5 篇文章 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.

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool traverse(TreeNode *t,int tmpsum,const int sum)
    {
        if(t != NULL)
        {
            if(t->left==NULL && t->right==NULL)
            {
                if(tmpsum+t->val == sum)
                    return true;
            }
        
            return traverse(t->left ,tmpsum+t->val ,sum) || traverse(t->right,tmpsum+t->val ,sum);
        }
        return false;
        
    }
    
    bool hasPathSum(TreeNode *root, int sum) {
        if(root==NULL)
            return false;
        return traverse(root,0,sum);
        
    }
};