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.
题目大概的意思就是给出一个二叉树和一个特定的值,我们来判断是否有路径相加可以达到这个和。
代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
bool hasPathSum(struct TreeNode* root, int sum) {
if(root==NULL)
return false;
int newSum=sum-root->val;
if(newSum==0&&root->left==NULL&&root->right==NULL)
return true;
return hasPathSum(root->left,newSum)||hasPathSum(root->right,newSum);
}