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.
For 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.
分析,这个问题是用递归的思想做。
首先Step1:root如果是null,则返回false;否则转step2;
Step2:判断当前节点是否为叶子节点并且其值等于sum;若是则返回true,否则转到Step3;
Step3:hasPathSum(root.left,sum-root.val)||hasPathSum(root.right,sum-root.val);
public boolean hasPathSum(TreeNode root, int sum) {
if(root == null ){
return false;
}
else{
if(root.val==sum && root.left==null && root.right == null){/*必须是叶子节点时才可以*/
return true;
}
return hasPathSum(root.left,sum-root.val)||hasPathSum(root.right,sum-root.val);
}
}
注意:用递归的思想做题目的时候,首先要理清思路。找到返回值时的条件和递归调用的位置。