力扣-112.路径总和

思路：

        在循环遍历的过程中，如果遇到叶子节点，而且targetsum正好等于0，那么就返回True，否则回溯道上一层。直到遍历完还没找到合适的路径，则返回False。

/**
 * 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:
    bool J_g(TreeNode *cur, int cnt)
    {
        
        if(!cur->left &&!cur->right && cnt == 0)return true;
        if(!cur->left && !cur->right)return false;
        

        if(cur->left){
            cnt -= cur->left->val;
           if(J_g(cur->left,cnt)) return true;
            cnt += cur ->left ->val;
        }

        if(cur->right){
            cnt -= cur->right->val;
           if(J_g(cur->right,cnt)) return true;
            cnt += cur ->right ->val;
        }
        return false;
    }
    bool hasPathSum(TreeNode* root, int targetSum) {
        if(root == NULL) return false;
         bool a = J_g(root,targetSum - root -> val);
         return a;
    }
};