Update 92. 反转链表 II.md

Author: CompetitiveLin

Linked List/92. 反转链表 II.md

@@ -119,3 +119,30 @@ class Solution {
 }
 ```
 
+Go语言：
+
+```go
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func reverseBetween(head *ListNode, left int, right int) *ListNode {
+    dummy := &ListNode{-1, head}
+    pre := dummy
+    for i := 0; i < left - 1; i++ {
+        pre = pre.Next
+    }
+    cur, next := pre.Next, pre.Next.Next
+    for i := 0; i < right - left; i++ {
+        cur.Next = next.Next
+        next.Next = pre.Next
+        pre.Next = next
+        next = cur.Next
+    }
+    return dummy.Next
+}
+```
+