题目描述
输入两个链表,找出它们的第一个公共结点。
class Solution {
public:
ListNode* FindFirstCommonNode( ListNode *pHead1, ListNode *pHead2) {
map<ListNode *,int>mp;
mp.clear();
while(pHead1)
{
mp[pHead1]=1;
pHead1=pHead1->next;
}
while(pHead2)
{
if(mp[pHead2]) return pHead2;
pHead2=pHead2->next;
}
return NULL;
}
};