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)
return false;
ListNode *pAhead=head, *pBehind=head;
while(pBehind!=NULL&&pBehind->next!=NULL)
{
pAhead=pAhead->next;
pBehind=pBehind->next->next;
if(pAhead==pBehind)
return true;
}
return false;
}
};