答案
// 代码解析:https://leetcode-cn.com/problems/linked-list-cycle-ii/solution/linked-list-cycle-ii-kuai-man-zhi-zhen-shuang-zhi-/
// a为快指针距离链表入口的距离!!!,b为链表环的节点数目
// 慢指针走的路程是:a + nb就能到链表环入口
// 当快慢指针相遇时,此时慢指针还差a步就能到达链表环入口(第一次相遇时慢指针已经走了nb步)
// 快指针指到开头即可
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
bool isCircle = false;
if(head == nullptr || head->next == nullptr) return nullptr;
ListNode* fast = head;
ListNode* slow = head;
// 此处也得加判断,否则会fast指向最后时可能是空指针!!!
// 必须得加判断
while(fast != nullptr && fast->next != nullptr) {
fast = fast->next->next;
slow = slow->next;
if(fast == slow) { // 找到相接节点
isCircle = true;
break;
}
}
if(isCircle == false) return nullptr;
fast = head;
while(fast != slow) {
fast = fast->next;
slow = slow->next;
}
return fast;
}
};