力扣-剑指Offer 52 两个链表的第一个公共节点（C++）

题目链接：https://leetcode-cn.com/problems/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof/
题目如下：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        unordered_set<ListNode*> set1;

        while(headA){
            set1.insert(headA);
            headA=headA->next;
        }

        while(headB){
            if(set1.count(headB)!=0) return headB;
            else headB=headB->next;
        }

        return NULL;
    }
};