一 简单解法:看ArrayList中是否已经有当前节点,没有则加入,第一个遍历到的已经存在的节点即为入口节点
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}
*/
import java.util.ArrayList;
public class Solution {
public ListNode EntryNodeOfLoop(ListNode pHead)
{
if(pHead == null || pHead.next == null){
return null;
}
ArrayList<ListNode> list = new ArrayList<>();
ListNode cur = pHead;
while(!list.contains(cur)){
list.add(cur);
cur = cur.next;
}
return cur;
}
}
二 两个指针一个fast,一个slow,同时从一个链表的头部出发,fast一次走两步,slow一次走一步,如果该链表有环,两个指针必然在环内相遇,此时只需要把其中一个指针重新指向链表头部,另一个不变(还在环内),这次两个指针都一次走一步,相遇的的地方就是如果节点
/*
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 || pHead.next.next == null) {
return null;
}
ListNode fast = pHead.next.next;
ListNode low = pHead.next;
while(fast != low){
if(fast.next.next == null || low.next == null){
return null;
}
fast = fast.next.next;
low = low.next;
}
fast = pHead;
while(fast != low){
fast = fast.next;
low = low.next;
}
return low;
}
}