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.
简单使用DFS来遍历。
首先,判断true的条件是走到了叶子,且路径值为sum。判断false的条件是走到了空节点(即超出了叶子都没能满足true,说明这条路径不符合)。
在每一步,sum都减去该节点的val。所以判断路径和等于sum即等于判断当前的sum是否为0。
在最开始做的时候试图判断sum是否小于0来提前退出而避免不必要的遍历。然而节点值是有正有负的,不能简单的这么判断。
总代码:
bool hasPathSum(TreeNode* root, int sum) {
if(root == nullptr)
return false;
sum -= root->val;
if(sum == 0 && root->left == nullptr && root->right == nullptr)
return true;
bool left = hasPathSum(root->left, sum);
bool right = hasPathSum(root->right, sum);
return left || right;
}