题目描述
给一个链表,若其中包含环,请找出该链表的环的入口结点,否则,输出null。
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};
*/
class Solution {
public:
ListNode* EntryNodeOfLoop(ListNode* pHead)
{
if(!pHead || pHead->next == NULL)
return NULL;
ListNode* p1 = pHead->next;
ListNode* p2 = pHead->next->next;
while(p1 != p2 && p2 != NULL)
{
p1 = p1->next;
p2 = p2->next->next;
}
if(p2 == NULL)
return NULL;
p2 = pHead;
while(p1 != p2)
{
p1 = p1->next;
p2 = p2->next;
}
return p2;
}
};