链接:https://leetcode-cn.com/problems/linked-list-cycle/
快指针一次走两步,慢指针一次走一步,若有环,快指针一定能追上慢指针,若无环,快指针会走到null
java代码:
public class Solution {
public boolean hasCycle(ListNode head) {
ListNode p = head;
ListNode q = head;
while(q!=null)
{
q = q.next;
if(q==null)
break;
q = q.next;
p = p.next;
if(p==q)
return true;
}
return false;
}
}