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.
题意:给定一个数,判断是否存在从根结点到叶节点的一条path, 使这条path上的结点的和为给定的数。
思路:递归实现。递归就是存在子问题,要分析相似的子问题。
/**
* 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){
if (root == NULL)
return false;
if (root->val == sum && root->left == NULL && root->right == NULL)
return true;
else{
int val = sum - root->val;
return hasPathSum(root->left, val) || hasPathSum(root->right, val);
}
}
};