My python code easy to understand

  • 0
    class Solution(object):
        def lowestCommonAncestor(self, root, p, q):
            :type root: TreeNode
            :type p: TreeNode
            :type q: TreeNode
            :rtype: TreeNode
            a1 = self.Ancestors(root, p)
            a2 = self.Ancestors(root, q)
            result = None
            for i in range(min(len(a1),len(a2))):
                if a1[i] == a2[i]:
                    result = a1[i]
            return result
        def Ancestors(self, root, x):
            nodes = []
            while True:
                if root:
                    if x.val > root.val:
                        root = root.right
                    elif x.val < root.val:
                        root = root.left
                        return nodes
                    return None

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.