-
题目:Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.
Follow up:
Can you solve it without using extra space? -
idea:
- 使用快慢指针,快指针每次走两步,慢指针每次走一步
- 假设慢指针走了(a+b),快指针走了a+b+n*(b)。则有2*(a+b) = a+b+n*(b)。因为快指针速度是慢指针的两倍。可得
a = ( n − 1 ) × ( b + c ) + c a = (n-1) \times (b+c)+c a=(n−1)×(b+c)+c
因此让两个指针分别从head以及相遇点开始走,总会在环开始的地方相遇。 - 第一个while循环不能为while (fast && slow && fast == slow),判断fast==slow必须在循环里,要不然只有一个节点的时候会判断为有环。
- code
/**
* 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) {
if (!head) return 0;
auto fast = head, slow = head;
while (fast && slow){
fast = fast->next;
if (!fast) return 0;
fast = fast->next;
slow = slow->next;
if (fast == slow) break;
}
if (!fast) return 0;
slow = head;
while (slow != fast){
slow = slow->next;
fast = fast->next;
}
return slow;
}
};