对应题一:
141. Linked List Cycle
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
最好的方法是时间复杂度O(n),空间复杂度O(1)的。设置两个指针,一个快一个慢,快的指针每次走两步,慢的指针每次走一步,如果快指针和慢指针相遇,则说明有环。参考:http://articles.leetcode.com/detecting-loop-in-singly-linked-list
代码:
class Solution {
public:
bool hasCycle(ListNode *head) {
ListNode *slow=head,*fast=head;
while(fast&&fast->next){
slow=slow->next;
fast=fast->next->next;
if(fast==slow)
return true;
}
return false;
}
};
题二: 142. Linked List Cycle II
题意:
Given a linked list, return the node where the cycle begins. If there is no cycle, return null
.
Note: Do not modify the linked list.
Follow up:
Can you solve it without using extra space?
分析:当fast和slow相遇时,slow肯定没有遍历完链表,而fast已经在环内循环了n圈(n>=1)。假设slow走了s步,则fast走了2s步(fast步数还等于s加上还上多转的n圈),设环长为r,则:
2s = s+nr
s = nr
设整个链表长L,环入口点与相遇点距离为a,起点到 环入口点的距离为x,则
x+a = nr = (n-1)r + L-x
x = (n-1)r + (L-x-a)
L-x-a 为相遇点到环入口点的距离。由此可知,从链表头到环入口点等于n-1圈内环 + 相遇点到环入口点,于是我们可以从head开始另设一个指针slow0,两个慢指针每次前进一步,它俩一定会在环入口点相遇。
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
ListNode *slow = head,*fast = head;
while(fast&&fast->next){
slow=slow->next;
fast=fast->next->next;
if(slow==fast){
ListNode *slow0=slow;
slow = head;
while(slow0!=slow){
slow0=slow0->next;
slow=slow->next;
}
return slow0;
}
}
return nullptr;
}
};