leetcode 141. Linked List Cycle

leetcode 141. Linked List Cycle

(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?

• 核心问题: 检查一个链表是否存在圈

最朴素的思路: 遍历list,检查一个node是否多次出现

class Solution {
public:
    bool hasCycle(ListNode *head) {
        set<ListNode *> S;
        while(head)
        {
            if(S.find(head) != S.end())
                return true;
            S.insert(head);
            head = head->next;
        }
        return false;
    }
};

O(1)的解决方法:

class Solution {
public:
    bool hasCycle(ListNode *head) {
        ListNode *fast = head, *slow = head;
        
        while (fast != NULL && fast->next != NULL)
        {
            fast = fast->next->next;
            slow = slow->next;
            
            if (fast == slow)
                return true;
        }
        
        return false;
    }
};