From a4d7ed61422dfef71149443eb84d3a8cb074a1b6 Mon Sep 17 00:00:00 2001
From: Yuhao Ju <juguaguaji@gmail.com>
Date: Sun, 4 Dec 2022 14:27:21 +0800
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:=20=E5=88=A0=E9=99=A4=20go=20=E5=86=97=E4=BD=99?=
 =?UTF-8?q?=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../0530.二叉搜索树的最小绝对差.md | 22 -------------------
 1 file changed, 22 deletions(-)

diff --git a/problems/0530.二叉搜索树的最小绝对差.md b/problems/0530.二叉搜索树的最小绝对差.md
index ad4f46d8..699afcf7 100644
--- a/problems/0530.二叉搜索树的最小绝对差.md
+++ b/problems/0530.二叉搜索树的最小绝对差.md
@@ -248,28 +248,6 @@ class Solution:
 ## Go： 
 
 中序遍历，然后计算最小差值
-
-```go
-func getMinimumDifference(root *TreeNode) int {
-    var res []int
-    findMIn(root,&res)
-    min:=1000000//一个比较大的值
-    for i:=1;i<len(res);i++{
-        tempValue:=res[i]-res[i-1]
-        if tempValue<min{
-            min=tempValue
-        }
-    }
-    return min
-}
-//中序遍历
-func findMIn(root *TreeNode,res *[]int){
-    if root==nil{return}
-    findMIn(root.Left,res)
-    *res=append(*res,root.Val)
-    findMIn(root.Right,res)
-}
-```
 ```go
 // 中序遍历的同时计算最小值
 func getMinimumDifference(root *TreeNode) int {