‘Linked List Cycle’ in LeetCode (Easy)
📌 Problem
https://leetcode.com/problems/linked-list-cycle/
📌 Answer
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public boolean hasCycle(ListNode head) {
if (head == null || head.next == null) return false;
Set<ListNode> set = new HashSet<>();
while (head != null) {
if (set.contains(head)) return true;
set.add(head);
head = head.next;
}
return false;
}
}
- Reference
Comments powered by Disqus.