import java.util.HashMap;
import java.util.Map;
/**
* 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) {
Map<ListNode, Integer> map = new HashMap<>();
while (head != null) {
if (map.containsKey(head)) {
return true;
} else {
map.put(head, 1);
head = head.next;
}
}
return false;
}
}

京公网安备 11010502036488号