path-sum leetcode C++

最新推荐文章于 2020-05-02 08:29:37 发布

DarrenXf

最新推荐文章于 2020-05-02 08:29:37 发布

阅读量219

点赞数

分类专栏： Algorithm 牛客网 C++ 算法 leetcode 文章标签： C leetcode 牛客网算法

本文链接：https://blog.csdn.net/DarrenXf/article/details/82768586

版权

算法同时被 3 个专栏收录

149 篇文章 0 订阅

订阅专栏

Algorithm

147 篇文章 0 订阅

订阅专栏

牛客网

146 篇文章 0 订阅

订阅专栏

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 andsum = 22, 5 /
4 8 / /
11 13 4 / \
7 2 1 return true, as there exist a root-to-leaf path5->4->11->2which sum is 22.

C++

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool hasPathSum2(TreeNode *root, int sum) {
        if(NULL == root) return false;
        if(NULL == root->left && NULL == root->right && sum == root->val) return true;
        if(NULL != root->left && hasPathSum(root->left,sum-root->val)) return true;
        if(NULL != root->right && hasPathSum(root->right,sum-root->val)) return true;
        return false;
    }
    
    bool hasPathSum(TreeNode *root, int sum) {
        if(NULL == root) return false;
        if(NULL == root->left && NULL == root->right && sum == root->val) return true;
        return hasPathSum(root->left,sum-root->val) || hasPathSum(root->right,sum-root->val);
    }
};