Leetcode Note: Go - Intersection of Two Linked Lists

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func getIntersectionNode(headA, headB *ListNode) *ListNode {
    if headA == nil || headB == nil {
        return nil
    }
    hasVisited := make(map[*ListNode]bool)
    
    for n := headA; n != nil; n = n.Next{
        hasVisited[n] = true
    }
    
    for n := headB; n != nil; n = n.Next{
        if _, ok := hasVisited[n]; ok {
            return n
        }
    }
    return nil
}