/**
* 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) {
set<ListNode*> nodeset;
while(headA)
{
nodeset.insert(headA);
headA=headA->next;
}
while(headB)
{
if(nodeset.find(headB)!=nodeset.end())
{
return headB;
}
headB=headB->next;
}
return NULL;
}
};
160. 相交链表
最新推荐文章于 2021-10-28 16:52:49 发布