Leetcode 112. Path Sum (Easy) (cpp)

最新推荐文章于 2020-06-13 18:19:02 发布

Niko_Ke

最新推荐文章于 2020-06-13 18:19:02 发布

阅读量568

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/Niko_Ke/article/details/52005948

C++ 同时被 3 个专栏收录

299 篇文章

订阅专栏

Leetcode C++

287 篇文章

订阅专栏

Leetcode Tree

48 篇文章

订阅专栏

本文介绍了解决LeetCode上题目112. Path Sum的方法。该题要求判断二叉树中是否存在一条从根节点到叶子节点的路径，使得路径上的节点值之和等于给定的目标值。文章提供了使用深度优先搜索(DFS)策略的C++代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Leetcode 112. Path Sum (Easy) (cpp)

Tag: Tree, Depth-first Search

Difficulty: Easy

/*

112. Path Sum (Easy)

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.

*/
/**
 * 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;
        } else if (root->left == NULL && root->right == NULL && sum == root->val) {
            return true;
        }
        return hasPathSum(root->left, sum - root->val) || hasPathSum(root->right, sum - root->val);
    }
};