LeetCode || Path Sum

最新推荐文章于 2021-10-31 17:50:40 发布

xuxumoi

最新推荐文章于 2021-10-31 17:50:40 发布

阅读量334

点赞数

分类专栏： LeetCode 文章标签： Path Sum LeetCode Tree Depth-First Search

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

版权

LeetCode 专栏收录该内容

107 篇文章 0 订阅

订阅专栏

Path Sum

题目链接耗时：12ms

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 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 curr = 0;
    bool flag = false;
    void dfs(TreeNode* root, int sum)
    {
        if(curr == sum && root->left == NULL && root->right == NULL)
        {
            flag = true;
            return;
        }
        
        if(root->left!=NULL)
        {
            curr+=root->left->val;
            dfs(root->left, sum);
            curr-=root->left->val;
        }
        if(root->right!=NULL)
        {
            curr+=root->right->val;
            dfs(root->right, sum);
            curr-=root->right->val;
        }
    }
    bool hasPathSum(TreeNode* root, int sum) {
        if(root == NULL)
           return false;
            
        curr+=root->val;
        dfs(root, sum);
        return flag;
    }
};