路径总和 III（树中递归套递归）

/**
 * 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:
    int count=0;
    void search(TreeNode *root,int targetSum){ 
        
        if(targetSum-root->val==0)
            count++;

        if(root->left!=NULL)
            search(root->left,targetSum-root->val);
        if(root->right!=NULL)
            search(root->right,targetSum-root->val);
        
    }

    void dfs(TreeNode *root,int targetSum){
        if(root!=NULL){
            search(root,targetSum);
            dfs(root->left,targetSum);
            dfs(root->right,targetSum);
        }
    }

    int pathSum(TreeNode* root, int targetSum) {
        dfs(root,targetSum);       
        return count;
    }
};