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