/**
* 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) {
return helper(root, sum);
}
private:
bool helper(TreeNode* root, int sum) {
if(!root) return false;
if(!root->left && !root->right)
if(root->val == sum)
return true;
return helper(root->left, sum - root->val) || helper(root->right, sum - root->val);
}
};
LeetCode112. 路径总和
最新推荐文章于 2024-07-11 14:30:42 发布