判断链表是否存在环

设置两个指针(fast, slow)，初始值都指向头，slow每次前进一步，fast每次前进二步，如果链表存在环，则fast必定先进入环，而slow后进入环，两个指针必定相遇。(当然，fast先行头到尾部为NULL，则为无环链表)程序如下：

struct Node
{
    int data;
    Node* next;
};

bool IsExitsLoop(Node *head)
{
    Node *slow = head, *fast = head;
    while ( fast && fast->next )
    {   
        slow = slow->next;
        fast = fast->next->next;
        if ( slow == fast )
            break;
    }   
    return ! (fast == NULL | | fast->next == NULL);
}