题目
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
思路
用快慢指针法,快指针每次移动2步,慢指针每次移动1步。如果有环,快指针会先进入环中,等slow进入环中就变成了追及问题。每次追一步,一定会相遇,相遇就说明有环。否则,快指针会先到尾部,即没有环。
关于环形链表的延伸问题推荐阅读:https://www.cnblogs.com/dancingrain/p/3405197.html
代码
/**
* 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* fast;
ListNode* slow;
if(head==nullptr||head->next==nullptr)
return false;
slow=head;
fast=head->next->next;
while(fast!=nullptr)
{
if(fast==slow)
return true;
else
{
if(fast->next!=nullptr)
{
fast=fast->next->next;
slow=slow->next;
}
else
return false;
}
}
return false;
}
};