/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
bool hasCycle(ListNode *head) {
ListNode * pquick = head;
ListNode * pslow = head;
while(1)
{
if(pslow)
{
pslow=pslow->next;
}
else
{
return false;
}
if(pquick->next &&pquick->next->next)
{
pquick=pquick->next->next;
}
else
{
return false;
}
if(pslow == pquick)
{
return true;
}
}
}
};
circle ``
最新推荐文章于 2021-11-18 19:42:55 发布