题目描述:给定一棵二叉树和一个值sum,若二叉树中存在一条从根节点到叶子结点的路径,该路径上所有结点值的和等于给定的值,返回true,否则返回false;
解题思路:递归实现思路非常简单
- 若根为空,返回false;
- 若根存在,左右子树都为空,根等于sum就返回true,否则返回false;
否则递归判断左右子树,新sum值等于sum减去根的值;
C++实现如下:
/**
* 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->left == NULL && root->right == NULL)
return sum == root->val;
return (hasPathSum(root->left, sum - root->val) || hasPathSum(root->right, sum - root->val));
}
};