思路:使用快、慢指针,当两个指针相等时,则链表有环。
/**
* 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_p=head;
ListNode *fast_p=head;
while(fast_p&&fast_p->next)
{
slow_p=slow_p->next;
fast_p=fast_p->next->next;
if(slow_p==fast_p) break;
}
return (fast_p!=NULL&&fast_p->next!=NULL);
}
};