代码随想录算法训练营第18天

最新推荐文章于 2024-11-05 15:28:12 发布

研三小学渣

最新推荐文章于 2024-11-05 15:28:12 发布

阅读量400

点赞数 9

文章标签： python

本文链接：https://blog.csdn.net/weixin_44733295/article/details/135959579

版权

本文介绍了三个关于二叉树的问题解决方案：1.递归寻找树的左下角值；2.判断给定路径和是否存在；3.根据中序和后序遍历序列构建二叉树。

摘要由CSDN通过智能技术生成

513. 找树左下角的值

class Solution:
    def __init__(self):
        self.max_depth = -1
        self.val = 0
    def findBottomLeftValue(self, root: Optional[TreeNode]) -> int:
        if not root:return
        self.dfs(root,0)
        return self.val
    def dfs(self,root,cur_depth):
        if not root.left and not root.right:
            if cur_depth > self.max_depth:
                self.max_depth = cur_depth
                self.val = root.val
        if root.left:
            cur_depth +=1
            self.dfs(root.left,cur_depth)
            cur_depth -=1
        if root.right:
            cur_depth +=1
            self.dfs(root.right,cur_depth)
            cur_depth -=1

112. 路径总和

class Solution:
    def hasPathSum(self, root: Optional[TreeNode], targetSum: int) -> bool:
        def isornot(root,targetSum):
            if not root.left and not root.right and  targetSum==0:
                return True
            if not root.left and not root.right:
                return False
            if root.left:
                targetSum -= root.left.val
                if isornot(root.left,targetSum): return True
                targetSum += root.left.val
            if root.right:
                targetSum -= root.right.val
                if isornot(root.right,targetSum): return True
                targetSum -= root.right.val
            return False
        return isornot(root,targetSum-root.val) if root else False

106. 从中序与后序遍历序列构造二叉树

class Solution:
    def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:
        if not postorder: return
        root_val = postorder[-1]
        root = TreeNode(root_val)
        sep_index = inorder.index(root.val)
        in_left = inorder[:sep_index]
        in_right = inorder[sep_index+1:]
        po_left = postorder[:len(in_left)]
        po_right = postorder[len(in_left):len(postorder)-1]
        root.left = self.buildTree(in_left, po_left)
        root.right = self.buildTree(in_right, po_right)
        return root