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
return dfs(root,sum);
}
public boolean dfs(TreeNode root, int sum){
if(root==null)
return false;
sum-=root.val;
if(root.left==null && root.right==null && sum==0)
return true;
return dfs(root.left,sum)|| dfs(root.right,sum)
}
}