public Node detectCycle(Node head) {
Node fast =head;
Node slow = head;
while(fast != null && fast.next != null){
fast = fast.next.next;
slow = slow.next;
//每一次发生变化,这里都需要进行判断
if(fast == slow){
break;
}
}
if (fast == null || fast.next == null){
return null;
}
slow = head;
while(slow != fast){
slow = slow.next;
fast = fast.nest;
}
return slow;
}