[剑指offer] JAVA版题解 面试题23

在这里插入图片描述
在这里插入图片描述

代码演示:

package swordfingeroffer;

/**
 * create by
 *
 * @Author 罗志远
 * @on 2020-05-31.
 * @time 19:33
 */
public class InterviewQuestion23 {
    public static class ListNode {
        int value;
        ListNode next;

        public ListNode(int value) {
            this.value = value;
        }
    }
    private ListNode meetListNode(ListNode pHead) {
        if (pHead == null) {
            throw new RuntimeException("链表不能为空!");
        }
        ListNode pSlow = pHead.next;
        if (pSlow == null) {
            return null;
        }
        ListNode pFast = pSlow.next;
        while (pFast != null && pSlow != null) {
            if (pFast == pSlow) {
                return pFast;
            }
            pSlow = pSlow.next;
            pFast = pFast.next;
            if (pFast != null) {
                pFast = pFast.next;
            }
        }
        return null;
    }
    public ListNode entryNodeOfLoop(ListNode pHead) {
        ListNode meetNode = meetListNode(pHead);
        if (meetNode == null) {
            return null;
        }
        // 得到环的节点数量
        int loopNodeNum = 1;
        ListNode pNode = meetNode;
        while (pNode.next != meetNode) {
            pNode = pNode.next;
            loopNodeNum ++;
        }
        ListNode preNode = pHead;
        for (int i = 0; i < loopNodeNum; i++) {
            preNode = preNode.next;
        }
        ListNode postNode = pHead;
        while (preNode != postNode) {
            preNode = preNode.next;
            postNode = postNode.next;
        }
        return preNode;
    }

    public static void main(String[] args) {

        ListNode listNode1 = new ListNode(1);
        ListNode listNode2 = new ListNode(2);
        ListNode listNode3 = new ListNode(3);
        ListNode listNode4 = new ListNode(4);
        ListNode listNode5 = new ListNode(5);
        ListNode listNode6 = new ListNode(6);


        listNode1.next = listNode2;
        listNode2.next = listNode3;
        listNode3.next = listNode4;
        listNode4.next = listNode5;
        listNode5.next = listNode6;
        listNode6.next = listNode3;
        InterviewQuestion23 interviewQuestion23 = new InterviewQuestion23();
        ListNode resultNode = interviewQuestion23.entryNodeOfLoop(listNode1);
        System.out.println(resultNode.value);
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值