代码实现:
//首先构造一个环
public void createCircle(){
Node cur = this.head;
while (cur.next != null){
cur = cur.next;
}
cur.next = this.head.next;
}
public boolean hasCircle(){
Node fast = this.head;
Node slow = this.head;
//判断是否有环,若有环则fast = slow
while (fast != null && fast.next != null) {
fast = fast.next.next;
slow = slow.next;
//fast和slow相遇
if (fast == slow) {
return true;
}
}
return false;
}