Linked List Cycle【判断链表是否有循环】

PROBLEM:

Given a linked list, determine if it has a cycle in it.

Follow up:

Can you solve it without using extra space?

SOLVE:

bool hasCycle(ListNode *head) {
    if(head == NULL || head -> next == NULL)    
        return false;
    ListNode *fast = head;
    ListNode *slow = head;
    while(fast -> next && fast -> next -> next){
        fast = fast -> next -> next;
        slow = slow -> next;
        if(fast == slow)
            return true;
    }
    return false;
}

def hasCycle(self, head):
    try:
        slow = head
        fast = head.next
        while slow is not fast:
            slow = slow.next
            fast = fast.next.next
        return True
    except:
        return False

解释：创建两个指针，一个的速度是另一个的两倍，如果有循环那他们就会相遇，叫弗洛伊德判圈算法（龟兔赛跑算法）。