链表 | LeetCode 142. 环形链表 II

142. 环形链表 II - 力扣（LeetCode） (leetcode-cn.com)https://leetcode-cn.com/problems/linked-list-cycle-ii/submissions/

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode detectCycle(ListNode head) {
        HashSet<ListNode> hashSet = new HashSet<ListNode>();
        while (head != null) {
            if (hashSet.contains(head))
                return head;
            hashSet.add(head);
            head = head.next;
        }
        return null;
    }
}

HashSet不多说了，无脑解决。

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode detectCycle(ListNode head) {
        if (head == null) {
            return null;
        }
        ListNode slowNode = head, fastNode = head;
        boolean n = false;
        while (fastNode.next != null && fastNode.next.next != null) {
            slowNode = slowNode.next;
            fastNode = fastNode.next.next;
            if (slowNode == fastNode) {
                n = true;
                break;
            }
        }
        if (n) {
            slowNode = head;
            while (slowNode != fastNode) {
                fastNode = fastNode.next;
                slowNode = slowNode.next;
            }
            return slowNode;
        }
        return null;
    }
}

 【蓝桥杯】ACM算法专家带300人集训10天，从8届真题挑选了这66道进行攻坚，看完视频小白也能去水一水国赛_哔哩哔哩_bilibili众所周知，蓝桥杯省赛是没有含金量的，咱直接冲国二以上视频配套刷题资料放在评论区了，需要的同学可以自取https://www.bilibili.com/video/BV1hi4y1k7Ho?p=12

第二种方法看看该视频，这种方法没必要列出具体的数学推导，从现有例子中总结出一种可行的方法，找不出反例即可直接用。