Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.
Note: A leaf is a node with no children.
Example:
Given the below binary tree and sum = 22
,
5 / \ 4 8 / / \ 11 13 4 / \ \ 7 2 1
return true, as there exist a root-to-leaf path 5->4->11->2
which sum is 22.
判断从跟到叶中是否存在有得到对应sum的路径结果:(叶没有左右节点)
public boolean hasPathSum(TreeNode root, int sum) {
if(root == null) {
return false;
}
return hasPathSum(root,sum,0);
}
boolean hasPathSum(TreeNode root, int sum, int now) {
if(root!=null) {
if(root.val+now == sum && root.left==null && root.right==null) {
return true;
}else {
return hasPathSum(root.left,sum,now+root.val)
|| hasPathSum(root.right,sum,now+root.val);
}
}
return false;
}