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.
DFS,要注意的点就是如果node的left!=null 那么要check left, 同理right, 但如果left == null && right!=null, 这个时候不要去check left, 而是跳过直接去check right, 只有当 left == null && right ==null 的时候, check node 本身。
当然也可以用BFS,但是需要额外空间。
public boolean hasPathSum(TreeNode root, int sum) {
if (root == null) return false;
if (root.left == null && root.right == null) {
return sum - root.val == 0;
}
return hasPathSum(root.left, sum - root.val) || hasPathSum(root.right, sum - root.val);
}