LeetCode112.路径总和

最新推荐文章于 2024-07-15 10:31:10 发布

Minkowski_lin

最新推荐文章于 2024-07-15 10:31:10 发布

阅读量111

点赞数

分类专栏： Python Data Structure DFS 图论 LeetCode algorithm

本文链接：https://blog.csdn.net/qq_42991793/article/details/87966674

版权

Python 同时被 3 个专栏收录

22 篇文章 0 订阅

订阅专栏

LeetCode

17 篇文章 0 订阅

订阅专栏

Data Structure

12 篇文章 0 订阅

订阅专栏

LeetCode112.路径总和

version 1

# Definition for a binary tree node.
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None


class Solution:
    def __init__(self):
        self.hasFind = False
        self.target = None

    def hasPathSum(self, root, sum):
        """
        :type root: TreeNode
        :type sum: int
        :rtype: bool
        """
        if not root: return False
        self.target = sum
        self.dfs(root, root.val)
        return self.hasFind

    def dfs(self, bt: TreeNode, s):
        if self.hasFind:
            return
        if s == self.target and not bt.left and not bt.right:
            self.hasFind = True
            return
        if bt.left:
            self.dfs(bt.left, s + bt.left.val)
        if bt.right:
            self.dfs(bt.right, s + bt.right.val)

version 2

# Definition for a binary tree node.
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None


class Solution:
    def hasPathSum(self, root, sum):
        """
        :type root: TreeNode
        :type sum: int
        :rtype: bool
        """
        if not root: return False
        elif root.val == sum and not root.left and not root.right:
            return True
        return self.hasPathSum(root.left, sum - root.val) or self.hasPathSum(root.right, sum - root.val)