/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
//递减数值,为0且为叶子节点,为真
bool getsum(TreeNode*node, int cot){
if (node->left == NULL && node->right == NULL && cot == 0) return true;
if (node->left == NULL && node->right == NULL) return false;
if (node->left != NULL){
cot = cot - node->left->val;
if (getsum(node->left, cot)) return true;//停止继续递归
cot = cot + node->left->val;
}
if (node->right != NULL){
cot = cot - node->right->val;
if (getsum(node->right, cot)) return true;
cot = cot + node->right->val;
}
return false;
}
bool hasPathSum(TreeNode* root, int targetSum) {
if (root == NULL) return false;
return getsum(root, targetSum - root->val);
}
};