class Solution {
public boolean hasPathSum(TreeNode root, int sum) {
if(root==null)return false;
int remain = sum - root.val;
if(remain==0&&root.left==null&&root.right==null)
return true;
return hasPathSum(root.left,remain)||hasPathSum(root.right,remain);
}
}
减法递归,思路比较好,记录一哈。