/**
* 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 == NULL || head->next == NULL) return false;
ListNode* fast;
ListNode* slow;
slow = head;
fast=head->next;
while(fast != slow)
{
if(fast == NULL || fast->next == NULL) return false;
slow=slow->next;
fast=fast->next->next;
}
return true;
}
};