Leetcode 路径问题 112（是否有路径bool）

最新推荐文章于 2025-04-03 15:29:45 发布

秀秀的奇妙旅行

最新推荐文章于 2025-04-03 15:29:45 发布

阅读量243

点赞数

文章标签： leetcode 算法

本文链接：https://blog.csdn.net/yunxiu988622/article/details/104976881

版权

sum值有可能为负

 Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf 
path such adding up all the values along the path equals the given sum.
Note: A leaf is a node with no children.

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.

其实这两种解法思路都是一样的，只不过第一种解法免去了分类讨论直接来个或更加的简洁

 bool hasPathSum(TreeNode *root, int sum) {
        if (root == NULL) return false;
        if (root->val == sum && root->left ==  NULL && root->right == NULL) return true;
        return hasPathSum(root->left, sum-root->val) || hasPathSum(root->right, sum-root->val);
    }

下边是自己写的代码大体思想private
1用一个result分别在根，左子树，右子树看有没有满足的路径，result是出口，如果在以上三处找到路径会返回true，否则返回result的初值false

/**
 * 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:
    bool hasPathSum(TreeNode* root, int sum) {
        vector<vector<int>>result;
        if(root==NULL){
            return false;
        }
        return corefunction(root,sum);              
    }
private:
    bool corefunction(TreeNode*root,int sum){
        bool result=false;
        if(root->val-sum==0&&root->left==NULL&&root->right==NULL){
            result =true;
        }
        else{
            if(root->left!=NULL&&result==false){
                result=corefunction(root->left,sum-root->val);
            }
            if(root->right!=NULL&&result==false){
                result=corefunction(root->right,sum-root->val);
            }
        }
        return result;
    }

};