112. Path Sum

最新推荐文章于 2019-07-08 10:31:58 发布

xu_jie_yu

最新推荐文章于 2019-07-08 10:31:58 发布

阅读量164

点赞数

本文链接：https://blog.csdn.net/xu_jie_yu/article/details/68950922

版权

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.

解题思路：

对于树的问题经常要使用递归的算法，这个问题我也是采用递归的算法，每到一个根节点就使sum减掉根的值，如果到叶节点时sum值正好等于叶的值，则说明有这样的一个路径，否则没有。

代码：

/**
* 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;
}
return hasPathSum(root->left, sum-root->val)||hasPathSum(root->right, sum - root->val);

}
};