/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(root == NULL) return false;
if(root->left == NULL && root->right == NULL)
return root->val == sum;
return hasPathSum(root->left, sum-root->val)
|| hasPathSum(root->right, sum-root->val);
}
};
[Leetcode]Path Sum
最新推荐文章于 2020-01-02 15:30:00 发布