贴原题:
Given a binary tree and a sum, determine if the tree has aroot-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,
![]()
return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.
解析
本题是给出一个二叉树和一个目标值,让判断是否存在一个叉树使得从根节点到叶节点所有的数之和等于给定的目标值,存在则返回true,否则返回false。
那么我的思路是利用递归思想,逐级判断,直到一个叶节点,如果其累加和等于目标值则返回true,否则返回false。叶节点的特征是父节点存在,左右孩子节点不存在。
贴代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
bool ifEqualTarget(struct TreeNode* root, int target, int sum)
{
if(root!=NULL && root->left==NULL && root->right==NULL && root->val+sum==target)//叶节点
{
return true;
}
if(root!=NULL)
{
if(ifEqualTarget(root->left, target, root->val+sum))//左孩子递归
{
return true;
}
if(ifEqualTarget(root->right, target, root->val+sum))//右孩子递归
{
return true;
}
}
return false;
}
bool hasPathSum(struct TreeNode* root, int sum) {
return root!=NULL && ifEqualTarget(root, sum, 0);//首先得满足根节点存在
}