代码随想录算法训练营第二十一天 | 530.二叉搜索树的最小绝对差 501.二叉搜索树中的众数 236. 二叉树的最近公共祖先

最新推荐文章于 2024-05-23 21:22:42 发布

Mi_chelle

最新推荐文章于 2024-05-23 21:22:42 发布

阅读量321

点赞数 7

文章标签：算法 python 开发语言

本文链接：https://blog.csdn.net/Mi_chelle/article/details/136258348

版权

530.二叉搜索树的最小绝对差

https://programmercarl.com/0501.%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E4%BC%97%E6%95%B0.html
牢记二叉搜索树是有序的！！！

class Solution:
    def getMinimumDifference(self, root: Optional[TreeNode]) -> int:
        ordered = self.convert2array(root)
        min_diff = float('inf')
        for i in range(len(ordered)):
            if i < len(ordered)-1:
                min_diff = min(abs(ordered[i+1] - ordered[i]), min_diff)
        return min_diff
  
    def convert2array(self,root):
        if not root:
            return []
        left = self.convert2array(root.left)
        right = self.convert2array(root.right)
        return left + [root.val] + right

501.二叉搜索树中的众数

https://programmercarl.com/0501.%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E4%BC%97%E6%95%B0.html

class Solution:
    def findMode(self, root: Optional[TreeNode]) -> List[int]:
        ordered = self.convert2array(root)
        most = 0
        result = []
        for i in range(len(ordered)):
            cur = sum([1 for j in ordered[i+1:] if j == ordered[i]])
            if cur == most:
                result.append(ordered[i])
            elif cur > most:
                most = cur
                result = [ordered[i]]
        return result

    def convert2array(self,root):
        if not root:
            return []
        left = self.convert2array(root.left)
        right = self.convert2array(root.right)
        return left + [root.val] + right

236. 二叉树的最近公共祖先

https://programmercarl.com/0236.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.html#%E5%85%B6%E4%BB%96%E8%AF%AD%E8%A8%80%E7%89%88%E6%9C%AC

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        if root == q or root == p or root is None:
            return root
        left = self.lowestCommonAncestor(root.left, p, q)
        right = self.lowestCommonAncestor(root.right, p, q)
  
        if left is not None and right is not None:
            return root
  
        if left is None and right is not None:
            return right
        elif left is not None and right is None:
            return left
        else:
            return None