判断是否带环
解题思路,定义俩个一快一慢的指针,快指针一次走俩步,慢指针一次走一步,如果俩指针最终相遇,则带环,否则不带环。
List* LoopList(List* phead){
assert(phead);
List* fast = phead;
List* slow = phead;
if (phead->next == NULL)
{
printf("不带环\n");
return NULL ;
}
while (1)
{
slow = slow->next;
fast = fast->next->next;
if ((fast == NULL) || (fast->next == NULL))
{
printf("不带环\n");
return NULL;
}
else if (fast == slow)
{
printf("带环\n");
return fast;
}
}
}
求环的长度
Data Looplen(List* pos) pos指向快慢俩指针的相遇点
{
assert(pos);
List* start = pos;
Data len = 0;
while (1)
{
start = start->next;
len++;
if (start == pos) 快慢指针在一定在环上相遇,相遇点上的指针每次走一步再次走到相遇点,就是环的长度
{
return len;
}
}
}
求环的入口点
void InLoop(List* phead, List* pos) pos为快慢指针在环上的相遇点,相遇点每次走一步,链表起始处定义一个指针point_1,point_1每次走一步,
{ 当pos和point_1相遇时,相遇点就是入口点。
List* point_1 = phead;
List* point_2 = pos;
while (1)
{
if (point_1 == point_2)
{
printf("此环入口点的数据为:%d ", phead->arrary);
break;
}
point_1 = point_1->next;
point_2 = point_2->next;
if (point_1 == point_2)
{
printf("此环入口点的数据为:%d ", point_1->arrary);
break;
}
}
}
慢指针和快指针相遇时,2*(a+c)=a+nb+c
所以a=nb-c;
故point_2和point_1每次各自走一步,相遇时即为入口点