2021-11-16 剑指 Offer II 050. 向下的路径节点之和

题目描述
解题思路：树的问题有三种解决方法：自身函数递归，外层函数递归，自身和外层函数双递归。这道题就是双递归的思路。让每一个节点都作为root进行外层函数递归。再设计全部变量，统计所以满足条件的路径。通过外层函数进行判断。

解题代码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    int sum = 0;
    public int pathSum(TreeNode root, int targetSum) {
        if(root == null){
            return 0;
        }
        dfs(root, targetSum);
        pathSum(root.left, targetSum);
        pathSum(root.right, targetSum);
        return sum;
    }
    public void dfs(TreeNode root, int targetSum){
        if(root == null){
            return;
        }
        targetSum -= root.val;
        if(targetSum == 0){
            sum++;
        }
        dfs(root.left, targetSum);
        dfs(root.right, targetSum);
    }
}