LeetCode 112. Path Sum C语言

最新推荐文章于 2022-08-26 00:33:12 发布

Iron~Man

最新推荐文章于 2022-08-26 00:33:12 发布

阅读量146

点赞数

分类专栏：每日LeetCode

本文链接：https://blog.csdn.net/yileahcwks/article/details/84947167

版权

每日LeetCode 专栏收录该内容

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

Note: A leaf is a node with no children.

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