问题描述:
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;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool hasPathSum(TreeNode* root, int sum) {
return dfs(root, 0, sum);
}
bool dfs(TreeNode* root, int presum, int sum)
{
if(root==NULL) return false;
if(!root->left && !root->right)
{//只有当到达叶子节点时,才判断和是否等于给定值
return presum + root->val == sum;
}
return dfs(root->left, presum+root->val, sum) || dfs(root->right, presum+root->val, sum);
}
};