LeetCode 112. Path Sum

二叉树路径和判断

最新推荐文章于 2023-11-14 10:16:47 发布

原创最新推荐文章于 2023-11-14 10:16:47 发布 · 343 阅读

0 ·

CC 4.0 BY-SA版权

算法分析与设计专栏收录该内容

14 篇文章

订阅专栏

本文探讨了如何确定一棵二叉树中是否存在从根节点到叶子节点的路径，使得路径上所有节点值之和等于给定的目标值。通过两种深度优先搜索的方法实现，包括直接递归方法和标准DFS模板。

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

解法二：标准DFS模板

/**
* 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 mybool = false;
void dfs(TreeNode* root , int sum , int currentsum) {
currentsum += root->val;
bool isleaf = root->left == NULL && root->right == NULL;
if (isleaf && currentsum == sum) mybool = true;
if (root->left) dfs(root->left , sum , currentsum);
if (root->right) dfs (root->right, sum, currentsum);
}
bool hasPathSum(TreeNode* root, int sum) {
if (root == NULL) return false;
dfs(root , sum , 0);
return mybool;
}
};