import java.util.*;
/*
* public class TreeNode {
* int val = 0;
* TreeNode left = null;
* TreeNode right = null;
* public TreeNode(int val) {
* this.val = val;
* }
* }
*/
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param root TreeNode类
* @param sum int整型
* @return int整型
*/
int key=0;
void dfs(TreeNode root,int sum){
if(null==root)return ;
sum-=root.val;
if(sum==0)++key;
dfs(root.left,sum);
dfs(root.right,sum);
}
public int FindPath (TreeNode root, int sum) {
if(null==root)return key;
dfs(root,sum);
FindPath(root.left,sum);
FindPath(root.right,sum);
return key;
}
}