环形链表 II(找出循环入口节点)

题目

题源

代码

快慢指针法

 //快慢指针法
public class Solution {
    public ListNode detectCycle(ListNode head) {
        if (head == null || head.next == null) return null;
        ListNode slow = head; 
        ListNode fast = head;
        while (fast != null) {
            slow = slow.next;
            if (fast.next != null) {               
                fast = fast.next.next;
            } else {
                return null;
            }
            if (slow == fast) {
                fast = head;
                while(slow != fast) {
                    slow = slow.next;
                    fast = fast.next;
                }
                return fast;
            }
        }
        return null;
    }
}

利用HashSet

// HashSet法
 public class Solution {
    public ListNode detectCycle(ListNode head) {
        ListNode pos = head;
        Set<ListNode> visited = new HashSet<ListNode>();
        while (pos != null) {
            if (visited.contains(pos)) {
                return pos;
            } else {
                visited.add(pos);
            }
            pos = pos.next;
        }
        return null;
    }
}