力扣-236 二叉树的最近公共祖先

最新推荐文章于 2024-01-02 16:03:27 发布

原创最新推荐文章于 2024-01-02 16:03:27 发布 · 214 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

24 篇文章

订阅专栏

本文介绍了一种使用Python实现的算法，通过预序遍历二叉树，寻找两个给定节点的最近公共祖先。核心在于记录节点路径并对比查找共同路径节点。

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        if root is None:
            return None
        path = []
        path_dict = {}
        # 记录当前点经历过的路径，重点
        def PreOrder(root, path):
            path.append(root)
            path_dict[root.val] = path
            if root.left:
                PreOrder(root.left, path[:])
            if root.right:
                PreOrder(root.right, path[:])
        PreOrder(root, path)
        p_path = path_dict[p.val]
        q_path = path_dict[q.val]
        # print(p_path)
        # print(q_path)
        res = 0
        # 根据已知路径，找到最近公共祖先
        for parents in zip(p_path, q_path):
            p_parent,q_parent = parents
            if p_parent.val == q_parent.val:
                res = p_parent
        return res