LeetCode 剑指 Offer 52. 两个链表的第一个公共节点
题目描述

思路分析
双指针遍历
参考代码
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
func getIntersectionNode(headA, headB *ListNode) *ListNode {
	if headA == nil || headB == nil {
		return nil
	}
	pA, pB := headA, headB
	for pA != pB {
		if pA == nil {
			pA = headB
		} else {
			pA = pA.Next
		}
		if pB == nil {
			pB = headA
		} else {
			pB = pB.Next
		}
	}
	return pA
}
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
func getIntersectionNode(headA, headB *ListNode) *ListNode {
	visited := make(map[*ListNode]bool)
	for cur := headA; cur != nil; cur = cur.Next {
		visited[cur] = true
	}
	for cur := headB; cur != nil; cur = cur.Next {
		if visited[cur] {
			return cur
		}
	}
	return nil
}
 
1
write your code here
 
                    
                    本博客所有文章除特别声明外,均采用
                    
                        CC BY-NC-SA 4.0
                    
                    许可协议,转载请注明出处!
                
                
            
