LeetCode 112. Path Sum

最新推荐文章于 2024-10-14 18:52:56 发布

yangb25

最新推荐文章于 2024-10-14 18:52:56 发布

阅读量154

点赞数

分类专栏： leetcode 文章标签： path leetcode equals

本文链接：https://blog.csdn.net/yangb25/article/details/73863280

版权

leetcode 专栏收录该内容

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

题目要求找出是否存在从根节点到叶节点的值之和为目标值的路径。因此进行一次DFS，并算出每条路径最终的和，若与目标值相同，则返回true。

class Solution {

    int find=0;

public:

    void cal(TreeNode* root, int sum,int s,int& find){

        if(root==NULL)

            return;

        s+=root->val;

        if(root->left==NULL&&root->right==NULL){

            if(s==sum){

                find=1;

                return;

            }           

        }

        else{

            cal(root->left,sum,s,find);

            cal(root->right,sum,s,find);           

        }

    }

    bool hasPathSum(TreeNode* root, int sum) {

        int s=0;

        cal(root,sum,s,find);

        return find==1;

    }

};