![在这里插入图片描述](https://i-blog.csdnimg.cn/direct/5144b07ee9dd471b940a4c56c53aed6c.png)
思路
- 遍历单链表A,将出现的节点用map存下来
- 遍历单链表B,判断是否已经存在于map中
func getIntersectionNode(headA, headB *ListNode) *ListNode {
m := make(map[*ListNode]bool)
for node := headA; node!= nil; node = node.Next {
m[node] = true
}
for node := headB; node != nil; node = node.Next {
if m[node] {
return node
}
}
return nil
}