/*
功能:判断链表是否含有环
*/
int IsCircle(LinkList pHead)
{
if ( !pHead || !pHead->next ) return 0;
LinkNode* pOne = pHead;
LinkNode* pTwo = pHead->next;
if ( !pTwo->next ) return 0;//只有两个节点
pOne = pOne->next;
pTwo = pTwo->next;
while ( pOne && pTwo )
{
if( pOne == pTwo )
{
return 1;
}
else
{
pOne = pOne->next;
pTwo = pTwo->next;
if( !pTwo || !pTwo->next )
{
return 0;
}
else
{
pTwo = pTwo->next;
}
}
}
return 0;
}
c++链表是否含有环
最新推荐文章于 2020-10-08 20:28:40 发布