题解 | #两个链表的第一个公共结点#

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* FindFirstCommonNode( ListNode* pHead1, ListNode* pHead2) {
        map<ListNode*, int> m;
        while(pHead1){
            m.insert(pair<ListNode*, int>(pHead1, 1));
            pHead1 = pHead1->next;
        }
        while(pHead2){
            if(m[pHead2] == 1)
                return pHead2;
            pHead2 = pHead2->next;
        }
        return pHead2;
    }
};