Given a linked list, determine if it has a cycle in it.
Follow up:
Follow up:
Can you solve it without using extra space?
题目:如何判断一个链表是否是含有环的
思路:使用两个指针,遍历整个链表,一个走一步,一个走两步。直到两个指针相等且都不为NULL的话则说明这个链表有环
/**
* 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 *p=head,*q=p->next;
bool res = false;
while(p&&q&&p!=q)
{
p=p->next;
int times=2;
while(q&×>0)
{
times--;
q=q->next;
}
}
if(p==q)
res=true;
return res;
}
};
如下代码比较简洁
/**
* 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;
while(true)
{
if(fast==NULL||fast->next==NULL)
return false;
slow=slow->next;
fast=fast->next->next;
if(slow==fast)
break;
}
return true;
}
};