import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * } */ public class Solution { /** * * @param root TreeNode类 * @param sum int整型 * @return bool布尔型 */ public boolean hasPathSum (TreeNode root, int sum) { // write code here // 递归出口 if (root == null) return false; if (root.left == null && root.right == null) return root.val == sum; boolean right = hasPathSum(root.right, sum - root.val); boolean left = hasPathSum(root.left, sum - root.val); return right || left; } }