141. Linked List Cycle

Linked List Cycle

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

There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail’s next pointer is connected to. Note that pos is not passed as a parameter.

Return true if there is a cycle in the linked list. Otherwise, return false.

Example 1:

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

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

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

Constraints:

The number of the nodes in the list is in the range [0, 104].
-105 <= Node.val <= 105
pos is -1 or a valid index in the linked-list.

Follow up: Can you solve it using O(1) (i.e. constant) memory?
题目的图复制不下来，题目的意思是判断链表是否存在一个cycle；

划重点使用O（1）memory解决该问题；
本来考虑通过Map记录node是否被访问，然后通过判断是否被访问来确定是否有环；
然后突然想到用list把访问过的node丢进去，判断list是否已存在拿到的node同样可以判断是否有环；

AC代码

public boolean hasCycle(ListNode head) {
        List<ListNode> listNodes = new ArrayList<>();
        ListNode node = head;
        boolean flag = false;
        while (node != null) {
            if (listNodes.contains(node)) {
                flag = true;
                break;
            }
            listNodes.add(node);
            node = node.next;
        }
        return flag;
    }