LeetCode142链表环的入口

连接

在141的基础上进行改进，先要判断链表是否有环，然后可以发现规律

package CLinkedList;

import AarrayProblem.Problem704;

/**
 * @Author Zhou  jian
 * @Date 2020 ${month}  2020/4/9 0009  18:31
 *
 * 环形链表的入环位置
 */
public class Problem142 {

    public ListNode detectCycle(ListNode head) {

        //先判断链表是否有环
        //链表有环
        ListNode meet = hasCycle(head);
        ListNode temp = head;
        //存在相遇节点
        if(meet!=null){
            meet=meet.next;
            //
            while(temp!=meet){
                temp=temp.next;
                meet=meet.next;
            }

            return temp;
        }

        return null;
    }

    //返回快慢指针相遇的节点
    public ListNode hasCycle(ListNode head){


        if(head == null || head.next == null)   return null;



        //定义快慢指针
        ListNode slow = head;
        ListNode quick = head;

        //
        while(quick.next!=null&&quick.next.next!=null){

            if(quick==slow) return quick;
            //更新快慢指针
            quick=quick.next.next;
            slow=slow.next;

        }
        return null;
    }


    public static void main(String[] args) {

        ListNode head = new ListNode(3);
        ListNode B = new ListNode(2);
        ListNode C = new ListNode(0);
        ListNode D = new ListNode(-4);

        head.next=B;
        B.next=C;
        C.next=D;
        D.next=B;

        Problem142 problem142 = new Problem142();
        problem142.detectCycle(head);


    }

}