[leetcode] 141. Linked List Cycle

Description

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

To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.

Example 1:

Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the second node.

Example 2:

Input: head = [1,2], pos = 0
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the first node.

Example 3:

Input: head = [1], pos = -1
Output: false
Explanation: There is no cycle in the linked list.

Analysis

设两个指针，一个快指针一个慢指针。快指针每次步长为2，慢指针每次步长为1。如果链表有环的话，快指针和慢指针将会在环上的某节点相遇，则返回True。链表没有环的话，快指针将会率先到达链表尾部，成为空指针，则返回false。

Code

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    bool hasCycle(ListNode *head) {
        if(head==NULL || head->next==NULL)
            return false;
        ListNode* fast = head->next;
        ListNode* slow = head;
        
        while(slow!=fast){
            if(fast==NULL || slow==NULL || fast->next==NULL)
                return false;
            fast = fast->next->next;
            slow = slow->next;
        }
        
        return true;
    }
};