class Solution {
public:
set<long int> s;
ListNode* FindFirstCommonNode( ListNode* pHead1, ListNode* pHead2) {
cout<<sizeof(pHead1);
while (pHead1 != nullptr)
{
s.insert((long int)pHead1);
pHead1 = pHead1->next;
}
while (pHead2 != nullptr)
{
if (s.count((long int)pHead2) == 1)
return pHead2;
else
pHead2 = pHead2->next;
}
return nullptr;
}
};
剑指offer第2版--面试题52:两个链表的第一个公共节点--基于set的做法(C++)
最新推荐文章于 2020-11-23 09:53:41 发布