Description

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.

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.

Solution

/**
* class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) {
*         val = x;
*         next = null;
*     }
* }
*/
public class Solution {
ArrayList<ListNode> arr = new ArrayList<>();
while (node != null && node.next != null) {
if (arr.contains(node)) {
return true;
}
node = node.next;
}
return false;
}
}

Feedback

// 풀이 1

public class Solution {
Set<ListNode> nodesSeen = new HashSet<>();
return true;
}
}
return false;
}
}
# 풀이 2

class Solution:
def hasCycle(self, head: ListNode) -> bool: