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.
注意点 : 注意区分单支树的情况
/**
* 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 DFS(TreeNode* root, int tmp,int sum){
// if(tmp>sum) return false;
if(root==NULL)
if(tmp==sum)
return true;
else
return false;
if(root->left!=NULL)
if(root->right==NULL)
return DFS(root->left,tmp+root->val,sum);
if(root->right!=NULL&&root->left==NULL) return DFS(root->right,tmp+root->val,sum);
return DFS(root->left,tmp+root->val,sum) || DFS(root->right,tmp+root->val,sum);
}
bool hasPathSum(TreeNode* root, int sum) {
if(root==NULL) return false;
return DFS(root,0,sum);
}
};