/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public ListNode EntryNodeOfLoop(ListNode pHead) {
if(pHead==null||pHead.next==null){
return null;
}
//使用快慢指针
ListNode slow=pHead.next;
ListNode fast=pHead.next.next;
//找到相遇点
while(fast!=null&&fast.next!=null&&slow!=fast){
slow=slow.next;
fast=fast.next.next;
}
//按照正常逻辑上面while循环结束slow和fast指针是相等的
//如果仍然不相等那就说明不存在环,返回null
if(slow!=fast){
return null;
}
slow=pHead;
while(slow!=fast){
slow=slow.next;
fast=fast.next;
}
return fast;
}
}