linked-list-cycle(LeetCode)

题目描述

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.
Follow up:
Can you solve it without using extra space?
题意是判断链表是否存在环，并给出环的起始结点。
1. 如何判断链表存在环
使用追赶法，也就是使用快慢两个指针，fast和slow，fast指针每次走两步，slow指针每次走一步。如果链表存在环，那么fast和slow最终会相遇，否则fast遇到null结束。
2. 找出环的起始结点

点Z为fast和slow指针的相遇点，设环的长度为n,则链表总长度为a+n，当slow指针走完a+b步与fast指针相遇时，fast指针已经在环上走了k圈。slow指针走了a+b步，fast指针走了2（a+b）步，fast指针比slow指针多走了k*n步，所以a+b=2（a+b）-k*n。即a=k*n -b,也就是X走a步，等于Z位置上的指针再走k圈，相遇于Y点。
3. 环的长度和链表总长度
从相遇点Z开始，slow和fast再次相遇的时候slow指针走过的距离就是环的长度。链表总长度为环的长度和2中求得的环起始结点长度之和。

package sxd.learn.java.leetcode;

/**
 * 
 * @author lab
 * 2016/5/30
 * linked-list-cycle-ii
 * Given a linked list, return the node where the cycle begins. If there is no cycle, return null. 
 */
public class Leetcode9 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        ListNode node1 = new ListNode(1);
        ListNode node2 = new ListNode(2);
        ListNode node3 = new ListNode(3);
        ListNode node4 = new ListNode(4);
        ListNode node5 = new ListNode(5);
        ListNode node6 = new ListNode(6);

        node1.next = node2;
        node2.next = node3;
        node3.next = node4;
        node4.next = node5;
        node5.next = node6;
        node6.next = node3;

        System.out.println(detectCycle(node1).val);
    }

    public static ListNode detectCycle(ListNode head) {
        if(head == null)
            return null;
        ListNode fast = head;
        ListNode slow = head;

        boolean isCycle = false;

        while(fast.next != null && fast.next.next != null){
            fast = fast.next.next;
            slow = slow.next; 
            if(slow.equals(fast)){
                isCycle = true;
                break;
            }
        }

        if(isCycle){
            fast = head;
            while(!fast.equals(slow)){
                fast = fast.next;
                slow = slow.next;
            }
            return fast;
        }else{
            return null;
        }

    }
}