/**
* 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){
return false;
}
ListNode fast=head;
ListNode slow=head;
while(fast.next!=null&&fast.next.next!=null){
fast=fast.next.next;
slow=slow.next;
if(fast==slow){
return true;
}
}
return false;
}
}
04-07
458
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
03-01
2518
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
05-17
587
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)