feature: add golang solution for leetcode 530 && 783

Author: hzliangbin

solution/0500-0599/0530.Minimum Absolute Difference in BST/README.md

@@ -56,9 +56,35 @@
 
 ```
 
-### **...**
-```
-
+### **Go**
+```go
+var res int
+var preNode *TreeNode
+func getMinimumDifference(root *TreeNode) int {
+    res = int(^uint(0) >> 1)
+    preNode = nil
+    helper(root)
+    return res
+}
+
+func helper(root *TreeNode)  {
+    if root == nil {
+        return
+    }
+    helper(root.Left)
+    if preNode != nil {
+        res = getMinInt(res, root.Val - preNode.Val)
+    }
+    preNode = root
+    helper(root.Right)
+}
+
+func getMinInt(a,b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}
 ```
 
 <!-- tabs:end -->

solution/0500-0599/0530.Minimum Absolute Difference in BST/Solution.go

@@ -0,0 +1,27 @@
+var res int
+var preNode *TreeNode
+func getMinimumDifference(root *TreeNode) int {
+    res = int(^uint(0) >> 1)
+    preNode = nil
+    helper(root)
+    return res
+}
+
+func helper(root *TreeNode)  {
+    if root == nil {
+        return
+    }
+    helper(root.Left)
+    if preNode != nil {
+        res = getMinInt(res, root.Val - preNode.Val)
+    }
+    preNode = root
+    helper(root.Right)
+}
+
+func getMinInt(a,b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}

solution/0700-0799/0783.Minimum Distance Between BST Nodes/README.md

@@ -57,9 +57,44 @@
 
 ```
 
-### **...**
-```
-
+### **Go**
+```go
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+
+var res int
+var preNode *TreeNode
+func minDiffInBST(root *TreeNode) int {
+    res = int(^uint(0) >> 1)
+    preNode = nil
+    helper(root)
+    return res
+}
+
+func helper(root *TreeNode)  {
+    if root == nil {
+        return
+    }
+    helper(root.Left)
+    if preNode != nil {
+        res = getMinInt(res, root.Val - preNode.Val)
+    }
+    preNode = root
+    helper(root.Right)
+}
+
+func getMinInt(a,b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}
 ```
 
 <!-- tabs:end -->

solution/0700-0799/0783.Minimum Distance Between BST Nodes/Solution.go

@@ -0,0 +1,36 @@
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+
+var res int
+var preNode *TreeNode
+func minDiffInBST(root *TreeNode) int {
+    res = int(^uint(0) >> 1)
+    preNode = nil
+    helper(root)
+    return res
+}
+
+func helper(root *TreeNode)  {
+    if root == nil {
+        return
+    }
+    helper(root.Left)
+    if preNode != nil {
+        res = getMinInt(res, root.Val - preNode.Val)
+    }
+    preNode = root
+    helper(root.Right)
+}
+
+func getMinInt(a,b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}