class TreeNode:
def __init__(self, val=0, left=None, right=None):
self.val = val
self.left = left
self.right = right
# 如果第一個節點沒有找到，第一個就等于前一個節點大于root節點的前一個節點
# 如果第一個節點已經找到，第二個就等于前一個節點大于root節點的root節點
class Solution:
def recoverTree(self, root: TreeNode) -> None:
"""
Do not return anything, modify root in-place instead.
"""
self.firstNode = None
self.secondNode = None
self.preNode = TreeNode(float("-inf"))
self.dfs(root)
self.firstNode.val,self.secondNode.val = self.secondNode.val,self.firstNode.val
def dfs(self,root):
if not root:
return
self.dfs(root.left)
if self.firstNode == None and self.preNode.val > root.val:
self.firstNode = self.preNode
if self.firstNode and self.preNode.val > root.val:
self.secondNode = root
self.preNode = root
self.dfs(root.right)
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/61897.html
標籤：Python
上一篇：Python GUI專案實戰：主表單的界面設計與實作
下一篇：93復原IP地址。