题解 | #二叉树中和为某一值的路径(一)#
二叉树中和为某一值的路径(一)
https://www.nowcoder.com/practice/508378c0823c423baa723ce448cbfd0c
/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ class Solution { public: /** * * @param root TreeNode类 * @param sum int整型 * @return bool布尔型 */ bool hasPathSum(TreeNode* root, int sum) { // write code here if(root==nullptr)return false; if(root->left==nullptr&&root->right==nullptr&&root->val==sum)return true; return hasPathSum(root->left,sum-root->val)||hasPathSum(root->right,sum-root->val); } };