783 递归实现

lection · lection · commit e705bd04faea · 2019-06-18T21:45:39.000+08:00
diff --git a/Week_01/id_3/recursion/783/LeetCode_783_3_v2.py b/Week_01/id_3/recursion/783/LeetCode_783_3_v2.py
@@ -0,0 +1,16 @@
+class Solution:
+    def minDiffInBST(self, root) -> int:
+        # 取值2-100之间
+        self.diff = 100
+        self.last = -100
+
+        def dfs(node):
+            if not node:
+                return
+            dfs(node.left)
+            self.diff = min(self.diff, node.val-self.last)
+            self.last = node.val
+            dfs(node.right)
+
+        dfs(root)
+        return self.diff
