算法训练 Day23

最新推荐文章于 2024-10-19 16:37:08 发布

m0_73129924

最新推荐文章于 2024-10-19 16:37:08 发布

阅读量25

点赞数

文章标签： leetcode 算法 python 职场和发展

本文链接：https://blog.csdn.net/m0_73129924/article/details/128951116

版权

669. 修剪二叉搜索树

解法：递归

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def trimBST(self, root: Optional[TreeNode], low: int, high: int) -> Optional[TreeNode]:
        if not root:
            return None
        
        if root.val < low:
            return self.trimBST(root.right,low,high)
        if root.val > high:
            return self.trimBST(root.left,low,high)
        root.left = self.trimBST(root.left,low,high)
        root.right = self.trimBST(root.right,low,high)
        return root

108.将有序数组转换为二叉搜索树

解法：递归

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:
        def dfs(left,right):
            if left > right:
                return None
            mid = (left+right)//2
            num = nums[mid]
            root = TreeNode(num)
            root.left = dfs(left,mid-1)
            root.right = dfs(mid+1,right)
            return root
        
        return dfs(0,len(nums)-1)

538.把二叉搜索树转换为累加树

解法：递归

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def convertBST(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
        pre = None
        def dfs(cur):
            if not cur:
                return 0
            nonlocal pre
            dfs(cur.right)
            if pre != None:
                cur.val += pre.val
            pre = cur
            dfs(cur.left)
        dfs(root)
        return root