/**
* 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) {
if(!root)
return false;
if(!root->left&&!root->right)
return sum==root->val;
if(!root->right)
return hasPathSum(root->left,sum-root->val);
if(!root->left)
return hasPathSum(root->right,sum-root->val);
return hasPathSum(root->left,sum-root->val)|hasPathSum(root->right,sum-root->val);
}
};
leetcode 112: Path Sum
最新推荐文章于 2021-05-11 15:07:28 发布