思路:
双指针,快慢指针
一个 快指针 ListNode fast
一个 慢指针 ListNode slow
快指针走两步,慢指针走一步,如果 最终快慢指针重合了,说明此链表有环
题解
public class Solution {
piblic boolean hasCycle(ListNode head){
if(head == null ){
return false;
}
ListNode fast = head;
ListNode slow = head;
while( fast != null && fast.next != null ){
fast = head.next.next;
slow = head.next;
if(fast == slow ){
return = true ;
}
}
return false ;
}
}