LeetCode --- 141. Linked List Cycle

141. Linked List Cycle

Difficulty: Easy

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.

Follow up:

Can you solve it using O(1) (i.e. constant) memory?

Solution

思路1

使用set容器保存每个ListNode的地址，遍历整个链表，如果在set中找到当前地址，说明有环，否则无环，具体如代码。
弊端：虽然此代码能实现，但是空间复杂度和时间复杂度较高。

Language: C++

/**
 * 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) {
        set<ListNode *> s;
        ListNode* p = head;
        while(p){
            if (s.find(p) == s.end())	//set中未找到当前地址，将其插入
                s.insert(p);
            else						//找到当前地址，说明有环
                return true;
            p = p->next;
        }
        return false;
    }
};

思路2

使用快慢指针。
快指针每次走两步，慢指针每次走一步，如果有环，快慢指针一定重合，无环不重合。

/**
 * 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)   return false;
        ListNode *low = head, *fast = head;
        while (fast && fast->next){
            low = low->next;     
            fast = fast->next->next;     
            if (low == fast)
                return true;
        }
        return false;
    }
};