Given a linked list, return the node where the cycle begins. If there is no cycle, return null
.
To represent a cycle in the given linked list, we use an integer pos
which represents the position (0-indexed) in the linked list where tail connects to. If pos
is -1
, then there is no cycle in the linked list.
Note: Do not modify the linked list.
Example 1:
Input: head = [3,2,0,-4], pos = 1 Output: tail connects to node index 1 Explanation: There is a cycle in the linked list, where tail connects to the second node.
Example 2:
Input: head = [1,2], pos = 0 Output: tail connects to node index 0 Explanation: There is a cycle in the linked list, where tail connects to the first node.
Example 3:
Input: head = [1], pos = -1 Output: no cycle Explanation: There is no cycle in the linked list.
解题思路:
step1:使用快慢指针判断是否存在环;
step2:寻找环的入口指针
(1)定义:起点到环入口的路程为L1;
(2)定义:慢指针从环入口到快慢指针相遇点的路程为L2;
(3)定义:整个环的路程为C;
可以得到如下的等式:
2*(L1 + L2) = L1 + L2 + n*C => L1 + L2 = n*C =>L1 = n*C - L2
当快慢指针第一次相遇时,n=1,可得如下等式;
L1 = C - L2;
即从起始点到环入口的路程等于慢指针走到环入口的路程。
ListNode *detectCycle(ListNode *head) {
if (head == NULL || head->next == NULL)
return NULL;
ListNode *slow = head;
ListNode *fast = head;
ListNode *entry = head;
while (fast->next && fast->next->next) {
slow = slow->next;
fast = fast->next->next;
if (slow == fast) { // there is a cycle
while(slow != entry) { // found the entry location
slow = slow->next;
entry = entry->next;
}
return entry;
}
}
return NULL; // there has no cycle
}