给一个链表,若其中包含环,请找出该链表的环的入口结点,否则,输出null
经典追及问题,同leetcode142,注意环入口即相遇处和开始一起同速走相遇处。
public class Solution {
public ListNode EntryNodeOfLoop(ListNode pHead){
ListNode slow = pHead;
ListNode fast = pHead;
while(fast != null && fast.next != null){
slow = slow.next;
fast = fast.next.next;
if(fast == slow) break;
}
if(fast == null || fast.next == null) return null;
fast = pHead;
while(fast != slow){
fast = fast.next;
slow = slow.next;
}
return slow;
}
}