LeetCode 112: Path Sum

最新推荐文章于 2021-05-11 15:07:28 发布

yongyuandeie

最新推荐文章于 2021-05-11 15:07:28 发布

阅读量267

点赞数

分类专栏： leetcode 文章标签： leetcode Path-Sum

本文链接：https://blog.csdn.net/yongyuandeie/article/details/49468689

版权

leetcode 专栏收录该内容

91 篇文章 0 订阅

订阅专栏

Path Sum

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,

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

解题思路

代码如下：

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