/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
if(head == NULL)
return NULL;
ListNode *p = head,*q = head;
while(p != NULL)
{
q = q->next;
if(q == NULL)
return NULL;
q = q->next;
if(q == NULL)
return NULL;
p = p->next;
if(q == p)
break;
}
p = head;
while(p != NULL)
{
if(q == p)
return p;
q = q->next;
p = p->next;
}
return NULL;
}
};
leetcode:Linked List Cycle II
最新推荐文章于 2018-10-30 10:34:12 发布