Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
/**
* 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 = head->next;
ListNode* slow = head;
while(slow != NULL&&fast != NULL )
{
if(fast == slow)
{
return true;
}
if(slow->next != NULL)
slow = slow->next;
else
return false;
if(fast->next!= NULL && fast->next->next != NULL)
fast = fast->next->next;
else
return false;
}
return false;
}
};