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.
其实这个题就是leetcode前面第104题改编成的。采用广度优先遍历,每个节点的值改为从根节点到该节点的距离。如果碰到叶节点,那么查看根到叶节点的距离和是不是指定的sum,如果是则返回true,如果到结束还没有找到,那么返回false。
/**
* 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)
{
vector<TreeNode*> levelNode;
int currentsum = 0;
if (root == NULL)
return 0;
int levelNum = 1, nextlevel = 0;
levelNode.push_back(root);
while (!levelNode.empty())
{
for (int i = 0; i < levelNum; i++)
{
if (levelNode[0]->left == NULL && levelNode[0]->right == 0)
{
if (levelNode[0]->val == sum)
return true;
}
currentsum = levelNode[0]->val;
if (levelNode[0]->left != NULL)
{
levelNode[0]->left->val += currentsum;
nextlevel++;
levelNode.push_back(levelNode[0]->left);
}
if (levelNode[0]->right != NULL)
{
levelNode[0]->right->val += currentsum;
levelNode.push_back(levelNode[0]->right);
nextlevel++;
}
levelNode.erase(levelNode.begin());
}
levelNum = nextlevel;
nextlevel = 0;
}
return false;
}
};