From d7235d9f51b532dda387bf6e00be225f931ed275 Mon Sep 17 00:00:00 2001
From: NevS <1173325467@qq.com>
Date: Thu, 27 May 2021 21:39:32 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=2002.07.=E9=93=BE=E8=A1=A8?=
 =?UTF-8?q?=E7=9B=B8=E4=BA=A4=20go=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/面试题02.07.链表相交.md | 36 +++++++++++++++++++++++++
 1 file changed, 36 insertions(+)

diff --git a/problems/面试题02.07.链表相交.md b/problems/面试题02.07.链表相交.md
index 9e97264c..13014dd1 100644
--- a/problems/面试题02.07.链表相交.md
+++ b/problems/面试题02.07.链表相交.md
@@ -155,6 +155,42 @@ Python：
 
 Go：
 
+```go
+func getIntersectionNode(headA, headB *ListNode) *ListNode {
+    curA := headA
+    curB := headB
+    lenA, lenB := 0, 0
+    // 求A，B的长度
+    for curA != nil {
+        curA = curA.Next
+        lenA++
+    }
+    for curB != nil {
+        curB = curB.Next
+        lenB++
+    }
+    var step int
+    var fast, slow *ListNode
+    // 请求长度差，并且让更长的链表先走相差的长度
+    if lenA > lenB {
+        step = lenA - lenB
+        fast, slow = headA, headB
+    } else {
+        step = lenB - lenA
+        fast, slow = headB, headA
+    }
+    for i:=0; i < step; i++ {
+        fast = fast.Next
+    }
+    // 遍历两个链表遇到相同则跳出遍历
+    for fast != slow {
+        fast = fast.Next
+        slow = slow.Next
+    }
+    return fast
+}
+```
+
 javaScript: 
 
 ```js