数据结构：单链表操作之如何判断链表是否带环及相关操作

最新推荐文章于 2024-10-09 06:30:00 发布

Sharp_UP

最新推荐文章于 2024-10-09 06:30:00 发布

阅读量432

点赞数

分类专栏：数据结构文章标签：单链表环

本文链接：https://blog.csdn.net/Sharp_UP/article/details/75194751

版权

数据结构专栏收录该内容

16 篇文章 2 订阅

订阅专栏

//判断链表是否有环

int HasCircle(Node* pHead)
{
Node* low=pHead;
Node* fast=pHead;
while(fast != NULL && fast->next != NULL)
{
low=low->next;
fast=fast->next->next;
if(low==fast)
return 1;
}
return 0;
}

时间复杂度：O(1)

//求环中快慢指针相遇节点
Node* HasCircle(Node* pHead)
{
Node* low=pHead;
Node* fast=pHead;
if(pHead==NULL)
return NULL;
while(fast != NULL && fast->next != NULL)
{
low=low->next;
fast=fast->next->next;
if(low==fast)
return low;
}
return NULL;
}
//求环长度
int GetCircleLen(Node* pMeetNode)
{
Node* Node = pMeetNode->next;

int lenght = 1;
while(Node != pMeetNode )
{
lenght++;
Node = Node->next;
}
return lenght;
}

时间复杂度：O(1)

//求环的入口
Node* GetEnterNode(Node* pHead, Node* pMeetNode)
{
Node* start = pHead;
if(pHead == NULL)
return NULL;

while(start != pMeetNode)
{
start = start->next;
pMeetNode = pMeetNode->next;
}
return start;
}