#原题链接
https://www.nowcoder.com/practice/650474f313294468a4ded3ce0f7898b9?tpId=295&tqId=605&ru=%2Fpractice%2F253d2c59ec3e4bc68da16833f79a38e4&qru=%2Fta%2Fformat-top101%2Fquestion-ranking&sourceUrl=%2Fexam%2Foj
思路分析:
设置快慢指针,都从链表头出发,快指针每次走两步,慢指针一次走一步,假如有环,一定相遇于环中某点。证明:设置快慢指针fast和low,fast每次走两步,slow每次走一步。假如有环,两者一定会相遇(因为low一旦进环,可看作fast在后面追赶slow的过程,每次两者都接近一步,最后一定能追上)。
代码展示:
/**
* 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 == nullptr)
{
return false;
}
ListNode *fast,*slow; //快慢指针
fast = head;
slow = head;
while(fast->next!=nullptr&&fast->next->next!=nullptr)
{
fast = fast->next->next;
slow = slow->next;
if(fast == slow) //如果有环,两个指针终究会相遇
{
return true;
}
}
//如果有一个指针走到了空,说明没有环
return false;
}
};