/**
* Definition for binary tree
* 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)
{
if(!root) return false;
if(!root->left && !root->right && sum==root->val) return true;
bool lefthas=false,righthas=false;
if(root->left)
{
lefthas=hasPathSum(root->left,sum-root->val);
}
if(root->right)
{
righthas=hasPathSum(root->right,sum-root->val);
}
return lefthas||righthas;
}
};
Path Sum
最新推荐文章于 2024-10-08 17:25:07 发布