LeetCode 112. Path Sum（二叉树）

最新推荐文章于 2020-07-19 19:07:58 发布

da_kao_la

最新推荐文章于 2020-07-19 19:07:58 发布

阅读量105

点赞数

分类专栏： LeetCode 文章标签： LeetCode Easy Cpp 二叉树递归

本文链接：https://blog.csdn.net/da_kao_la/article/details/90748296

版权

LeetCode 专栏收录该内容

371 篇文章 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.

Note: A leaf is a node with no children.

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.

代码

/*
 * @lc app=leetcode id=112 lang=cpp
 *
 * [112] Path 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 {
private:
    bool _hasPathSum(TreeNode* root, int sum) {
        if (!root->left && !root->right) {
            return sum == root->val;
        }
        if (root->left && _hasPathSum(root->left, sum-root->val)) {
            return true;
        }
        if (root->right && _hasPathSum(root->right, sum-root->val)) {
            return true;
        }
        return false;
    }

public:
    bool hasPathSum(TreeNode* root, int sum) {
        if (!root) {
            return false;
        }
        return _hasPathSum(root, sum);
    }
};