problem:
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.
题意:检查二叉树根节点到叶子的所有路径中,是否存在一条路径的数值和为 指定数 sum
thinking:
(1)DFS思想,递归遍历孩子节点,并记录结点数值和,到达叶子节点时(左右孩子为空)与sum比较大小
(2)曾考虑:在到达叶子节点之前,如果数值和》=sum,应该结束搜索,起到加速搜索的作用。但是,如果结点数据全为负数则不适合。
所以考虑问题要全面。
code:
class Solution {
private:
bool flag;
public:
bool hasPathSum(TreeNode *root, int sum) {
flag=false;
if(root==NULL)
return false;
dfs(0,sum,root);
return flag;
}
protected:
void dfs(int add, int sum, TreeNode *node)
{
if(flag==true)
return;
add+=node->val;
if(node->left==NULL && node->right==NULL)
{
if(add==sum)
flag=true;
return;
}
// if(add>=sum)
// return;
if(node->left!=NULL)
dfs(add,sum,node->left);
if(node->right!=NULL)
dfs(add,sum,node->right);
}
};