import java.util.*;
/*
- public class TreeNode {
- int val = 0;
- TreeNode left = null;
- TreeNode right = null;
- public TreeNode(int val) {
-
this.val = val;
- }
- } */
//解析1作者666,我就是照着他的思路走的。 public class Solution { /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param root TreeNode类 * @param sum int整型 * @return int整型 */ int path = 0; public int FindPath (TreeNode root, int sum) { if(root == null) return 0;
jisuan(root,sum,0);
FindPath(root.left, sum);
FindPath(root.right, sum);
return path;
}
public void jisuan(TreeNode tree,int sum,int num) {
if(tree == null) return ;
num = num + tree.val;
if(num == sum) {
path++;
//return ;
}
jisuan(tree.left,sum,num);
jisuan(tree.right,sum,num);
}
}