/**
* 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) {
if( !head || !head->next )
return false;
if( head->next == head )
return true;
ListNode * fast = head->next;
ListNode * slow = head;
while( true )
{
if( fast == slow )
return true;
fast = fast->next;
if( !fast )
return false;
fast = fast->next;
if( !fast )
return false;
slow = slow->next;
if( !slow )
return false;
}
}
};
Linked List Cycle
最新推荐文章于 2022-12-06 22:57:02 发布