python写算法题：leetcode: 99. Recover Binary Search Tree

最新推荐文章于 2021-09-10 20:44:14 发布

激荡数十年

最新推荐文章于 2021-09-10 20:44:14 发布

阅读量139

点赞数

分类专栏：算法 python

本文链接：https://blog.csdn.net/lzf_china/article/details/100093545

版权

算法同时被 2 个专栏收录

158 篇文章 0 订阅

订阅专栏

python

115 篇文章 0 订阅

订阅专栏


class Solution(object):
    def checkOrder(self, node, checkNode, dsc):
        if checkNode[0]!=None: return
        if node==None:
            return
        if dsc:
            self.checkOrder(node.left, checkNode,  dsc)
            if checkNode[0]!=None:
                return
            if checkNode[1]!=None and checkNode[1].val>node.val:
                checkNode[0]=checkNode[1]
                return
            checkNode[1]=node
            self.checkOrder(node.right, checkNode, dsc)
        else:
            self.checkOrder(node.right, checkNode,  dsc)
            if checkNode[0]!=None:
                return
            if checkNode[1]!=None and checkNode[1].val<node.val:
                checkNode[0]=checkNode[1]
                return
            checkNode[1]=node
            self.checkOrder(node.left, checkNode, dsc)
        return None

    def recoverTree(self, root):
        """
        :type root: TreeNode
        :rtype: None Do not return anything, modify root in-place instead.
        """
        wrongOrder0=[None, None]
        self.checkOrder(root, wrongOrder0, True)
        wrongOrder1=[None, None]
        self.checkOrder(root, wrongOrder1, False)
        wrongOrder0[0].val,wrongOrder1[0].val=wrongOrder1[0].val,wrongOrder0[0].val