判断一个链表是否有环
定义两个指针,快指针步长为2,慢指针步长为1.同时从链表头开始出发。如果链表中有环那么他们必然相遇。
bool hasCycle(ListNode *head) {
if(!head)
return false;
ListNode* fast = head->next;
ListNode* slow = head;
while(fast) {
if(fast == slow)
return true;
if(fast->next&&fast->next->next){
fast = fast->next->next;
slow = slow->next;
}
else
return false;
}
return false;
}
判断环开始的地方
引用的思路:
It is a famous known problem Hare and Tortoise Length of head to cycle started node:x
Length of the cycle: y
Let hare run two steps while tortoise runs one step
while both of them entered the cycle, the hare is definetly to overlap the tortoise at some node, we define it as m:
The hare totally runs: x + ky + m The tortoise totally runs: x + ty + m Thus, ky = 2ty + x + m we have (x + m) mod y = 0 We can conclude that if the hare run more x steps, it will reach the cycle's starting node.
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
ListNode* slow = head;
ListNode* fast = head;
do{
if( !slow || !fast ) return NULL;
slow = slow->next;
fast = fast->next;
if( fast ) fast = fast->next;
else return NULL;
}while( slow != fast );
slow = head;
while( slow != fast ){
slow = slow->next;
fast = fast->next;
}
return slow;
}
};
求链表中倒数第k个结点
假设链表长度为n,那么我们轻松得出这些结论:链表中的倒数第k个结点也就是正数第n-(k-1)个结点。所以我们只需要正向的让指针走n-k次,那么指针停留的结点便是倒数第k个结点。走完这个链表需要走的步长是n-1。
我们定义两个指针,快指针先出发,走k-1步。此时它停在正数第k个结点上。慢指针也开始从链表头出发。两个指针步长都为1,走到快指针为NULL为止。快指针停止时他走的第二段路的长度就是慢指针的长度:(n-1)-(k-1)= n-k.根据第一段的推导可知此致慢指针的指向便是倒数第k个结点。
ListNode* find(ListNode* head,int k)
{
if(!head)
return NULL;
ListNode* fast = head;
ListNode* slow = head;
for(int i=0;i<k-1;++)
fast = fast->next;
while(fast)
{
fast = fast->next;
slow = slow->next;
}
return slow;
}
求链表的中间结点
这个比较简单。也是定义两个指针,快指针步长为2,慢指针步长为1。同时从head出发,当快指针为NULL时,慢指针就停在中间结点了。
ListNode* findMid(ListNode* head)
{
if(!head)
return NULL;
ListNode* fast = head;
ListNode* slow = head;
while(fast = fast->next)
{
fast = fast->next;
slow = slow->next;
}
return slow;
}