1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43

// @Title: 相交链表 (Intersection of Two Linked Lists)
// @Author: 15816537946@163.com
// @Date: 2022-03-26 19:41:56
// @Runtime: 28 ms
// @Memory: 7 MB
/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */


func getIntersectionNode(headA, headB *ListNode) *ListNode {
	cA, cB := headA, headB
	for cA != nil && cB != nil {
		cA, cB = cA.Next, cB.Next
	}

	var kA, kB int
	for cA != nil {
		cA = cA.Next
		kA++
	}
	for cB != nil {
		cB = cB.Next
		kB++
	}

	for i := 0; i < kA; i++ {
		headA = headA.Next
	}
	for i := 0; i < kB; i++ {
		headB = headB.Next
	}

	for headA != headB {
		headA, headB = headA.Next, headB.Next
	}

	return headA
}