From 37d12a168cfa59e0ae44203f5aa8234d588f23fd Mon Sep 17 00:00:00 2001
From: ZerenZhang2022 <118794589+ZerenZhang2022@users.noreply.github.com>
Date: Wed, 22 Mar 2023 18:22:15 -0400
Subject: [PATCH] =?UTF-8?q?Update=200530.=E4=BA=8C=E5=8F=89=E6=90=9C?=
 =?UTF-8?q?=E7=B4=A2=E6=A0=91=E7=9A=84=E6=9C=80=E5=B0=8F=E7=BB=9D=E5=AF=B9?=
 =?UTF-8?q?=E5=B7=AE.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

增加python - 双指针法，不用数组 (同Carl写法) - 更快
---
 .../0530.二叉搜索树的最小绝对差.md | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)

diff --git a/problems/0530.二叉搜索树的最小绝对差.md b/problems/0530.二叉搜索树的最小绝对差.md
index 203add39..fa1430de 100644
--- a/problems/0530.二叉搜索树的最小绝对差.md
+++ b/problems/0530.二叉搜索树的最小绝对差.md
@@ -221,8 +221,27 @@ class Solution:
         for i in range(len(res)-1):  // 统计有序数组的最小差值
             r = min(abs(res[i]-res[i+1]),r)
         return r
+        
+        
+class Solution: # 双指针法，不用数组 (同Carl写法) - 更快
+    def getMinimumDifference(self, root: Optional[TreeNode]) -> int:
+        global pre,minval
+        pre = None
+        minval = 10**5
+        self.traversal(root)
+        return minval
+
+    def traversal(self,root):
+        global pre,minval
+        if not root: return None
+        self.traversal(root.left)
+        if pre and root.val-pre.val<minval: 
+            minval = root.val-pre.val
+        pre = root
+        self.traversal(root.right)            
 ```
 
+
 迭代法-中序遍历
 ```python 
 class Solution: