链接:https://oj.leetcode.com/problems/linked-list-cycle/
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?
方法:
快慢指针, 如果两个指针移动后能够再次相等则说明有环:
代码如下:
bool hasCycle(ListNode *head) {
if(head == NULL || head->next == NULL) return false;
ListNode *p1 = head;
ListNode *p2 = head;
while(p2 && p2->next )
{
p1 = p1->next;
p2 = p2->next->next;
if(p1 == p2) return true;
}
return false;
}
链接:https://oj.leetcode.com/problems/linked-list-cycle-ii/
Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null
.
Follow up:
Can you solve it without using extra space?
方法:
在上面的基础上两个指针相遇后,将其中一个指针指向head,而后两个指针都以一步的步长前进,指针再次相遇即为环的入口。
原理如下:
假设head到环入口节点的节点个数为 k, 从环入口节点到第一次相遇的节点距离为 s, 设环的节点数为r。则有 2 × ( k + s ) = k + x * r + s.( x 为第一次相遇时快指针在环中走的圈数)。由上面公式可以得到 k = x × r - s;
ListNode *detectCycle(ListNode *head) {
if(head == NULL || head->next == NULL) return NULL;
ListNode *p1 = head;
ListNode *p2 = head;
while(p2 && p2->next)
{
p1 = p1->next;
p2 =p2->next->next;
if(p1 == p2) break;
}
if(p1 == p2 && p1->next != NULL)
{
p1 = head;
while( p1 != p2)
{
p1 = p1->next;
p2 = p2->next;
}
return p1;
}
return NULL;
}