怎么判断链表中是否有环？

转自：http://topic.csdn.net/t/20051126/20/4420360.html bool CircleInList(Link* pHead) { if(pHead == NULL || pHead->next == NULL)//无节点或只有一个节点并且无自环 { return (false); } if(pHead->next == pHead)//自环 { return (true); } Link *pTemp1 = pHead;//step 1 Link *pTemp = pHead->next;//step 2 while(pTemp != pTemp1 && pTemp != NULL && pTemp->next != NULL) { pTemp1 = pTemp1->next; pTemp = pTemp->next->next; } if(pTemp == pTemp1) { return (true); } return (false); } The solution from < > ... First,eliminate the pathological case of a 3-element list with a cycle from element 2 to 1. Keep two pointers. One at element 1 and the next at element 3. See if they are equal; if not, move P1 by one and P2 by two. Check and continue. If P1 or P2 is null, there is no loop. If there is one, it will definitely be detected. One pointer will eventually catch up with the other (i.e., have the same value), though it might take several traversals of the cycle to do it.