如何判断一个单链表中是否有环

题目

给一个单链表，判断其中是否有环的存在

解题方法

（1）暴力法
给定一个足够大的循环上限，遍历链表，遍历到空指针则没有环，到达循环上限则认为有环

package com.company.algorithm.link;

public class LinkIsContainsRing {

    public static void main(String[] args) {
        LinkIsContainsRing linkIsContainsRing = new LinkIsContainsRing();
        LinkNode hasRingLinkNode = linkIsContainsRing.createHasRingLink(new int[]{1, 2, 3, 4, 5, 6});
        LinkNode noRingLinkNode = linkIsContainsRing.createNoRingLink(new int[]{1, 2, 3, 4, 5, 6});
        System.out.println(linkIsContainsRing.linkIsContainsRing(hasRingLinkNode));
        System.out.println(linkIsContainsRing.linkIsContainsRing(noRingLinkNode));
    }

    //创建没有环的链表
    private LinkNode createNoRingLink(int[] nums) {
        if (nums == null || nums.length < 3) return null;
        LinkNode[] linkNodes = new LinkNode[nums.length];
        for (int i = 0; i < nums.length; i++) {
            linkNodes[i] = new LinkNode(nums[i]);
            if (i > 0) linkNodes[i - 1].nextNode = linkNodes[i];
        }
        return linkNodes[0];
    }

    //创建有环的链表
    private LinkNode createHasRingLink(int[] nums) {
        if (nums == null || nums.length < 3) return null;
        LinkNode[] linkNodes = new LinkNode[nums.length];
        for (int i = 0; i < nums.length; i++) {
            linkNodes[i] = new LinkNode(nums[i]);
            if (i > 0) linkNodes[i - 1].nextNode = linkNodes[i];
        }
        linkNodes[nums.length - 1].nextNode = linkNodes[2];
        return linkNodes[0];
    }

    //暴力法
    private boolean linkIsContainsRing(LinkNode head) {
        int max = 10000;
        int i = 0;
        while (i++ < max && head != null) {
            head = head.nextNode;
        }
        return head != null;
    }
}

//节点类
class LinkNode {
    private int val;
    LinkNode nextNode;

    public LinkNode(int val) {
        this.val = val;
    }
}

执行结果

D:\Java\JDK\bin\java.exe "-javaagent:D:\IntelliJ IDEA 2019.3.3\lib\idea_rt.jar=10583:D:\IntelliJ IDEA 2019.3.3\bin" -Dfile.encoding=UTF-8 -classpath D:\Java\JDK\jre\lib\charsets.jar;D:\Java\JDK\jre\lib\deploy.jar;D:\Java\JDK\jre\lib\ext\access-bridge-64.jar;D:\Java\JDK\jre\lib\ext\cldrdata.jar;D:\Java\JDK\jre\lib\ext\dnsns.jar;D:\Java\JDK\jre\lib\ext\jaccess.jar;D:\Java\JDK\jre\lib\ext\jfxrt.jar;D:\Java\JDK\jre\lib\ext\localedata.jar;D:\Java\JDK\jre\lib\ext\nashorn.jar;D:\Java\JDK\jre\lib\ext\sunec.jar;D:\Java\JDK\jre\lib\ext\sunjce_provider.jar;D:\Java\JDK\jre\lib\ext\sunmscapi.jar;D:\Java\JDK\jre\lib\ext\sunpkcs11.jar;D:\Java\JDK\jre\lib\ext\zipfs.jar;D:\Java\JDK\jre\lib\javaws.jar;D:\Java\JDK\jre\lib\jce.jar;D:\Java\JDK\jre\lib\jfr.jar;D:\Java\JDK\jre\lib\jfxswt.jar;D:\Java\JDK\jre\lib\jsse.jar;D:\Java\JDK\jre\lib\management-agent.jar;D:\Java\JDK\jre\lib\plugin.jar;D:\Java\JDK\jre\lib\resources.jar;D:\Java\JDK\jre\lib\rt.jar;D:\JavaWorkSpace\day11\out\production\algorithm com.company.algorithm.link.LinkIsContainsRing
true
false

（2）标记法
从头到尾遍历链表节点值，将遍历过的节点值修改成Integer.MIN_VALUE，每次遍历到下一个节点后判断该节点的值是否与Integer.MIN_VALUE相等，如果相等则说明链表中存在环，否则不存在

package com.company.algorithm.link;

public class LinkIsContainsRing {

    public static void main(String[] args) {
        LinkIsContainsRing linkIsContainsRing = new LinkIsContainsRing();
        LinkNode hasRingLinkNode = linkIsContainsRing.createHasRingLink(new int[]{1, 2, 3, 4, 5, 6});
        LinkNode noRingLinkNode = linkIsContainsRing.createNoRingLink(new int[]{1, 2, 3, 4, 5, 6});
        System.out.println(linkIsContainsRing.linkIsContainsRing2(hasRingLinkNode));
        System.out.println(linkIsContainsRing.linkIsContainsRing2(noRingLinkNode));
    }

    //创建没有环的链表
    private LinkNode createNoRingLink(int[] nums) {
        if (nums == null || nums.length < 3) return null;
        LinkNode[] linkNodes = new LinkNode[nums.length];
        for (int i = 0; i < nums.length; i++) {
            linkNodes[i] = new LinkNode(nums[i]);
            if (i > 0) linkNodes[i - 1].nextNode = linkNodes[i];
        }
        return linkNodes[0];
    }

    //创建有环的链表
    private LinkNode createHasRingLink(int[] nums) {
        if (nums == null || nums.length < 3) return null;
        LinkNode[] linkNodes = new LinkNode[nums.length];
        for (int i = 0; i < nums.length; i++) {
            linkNodes[i] = new LinkNode(nums[i]);
            if (i > 0) linkNodes[i - 1].nextNode = linkNodes[i];
        }
        linkNodes[nums.length - 1].nextNode = linkNodes[2];
        return linkNodes[0];
    }

    //标记法:
    private boolean linkIsContainsRing2(LinkNode head) {
        while (head != null) {
            if (head.val == Integer.MIN_VALUE) return true;
            head.val = Integer.MIN_VALUE;
            head = head.nextNode;
        }
        return false;
    }

}

//节点类
class LinkNode {
    public int val;
    LinkNode nextNode;

    public LinkNode(int val) {
        this.val = val;
    }
}

执行结果

D:\Java\JDK\bin\java.exe "-javaagent:D:\IntelliJ IDEA 2019.3.3\lib\idea_rt.jar=10583:D:\IntelliJ IDEA 2019.3.3\bin" -Dfile.encoding=UTF-8 -classpath D:\Java\JDK\jre\lib\charsets.jar;D:\Java\JDK\jre\lib\deploy.jar;D:\Java\JDK\jre\lib\ext\access-bridge-64.jar;D:\Java\JDK\jre\lib\ext\cldrdata.jar;D:\Java\JDK\jre\lib\ext\dnsns.jar;D:\Java\JDK\jre\lib\ext\jaccess.jar;D:\Java\JDK\jre\lib\ext\jfxrt.jar;D:\Java\JDK\jre\lib\ext\localedata.jar;D:\Java\JDK\jre\lib\ext\nashorn.jar;D:\Java\JDK\jre\lib\ext\sunec.jar;D:\Java\JDK\jre\lib\ext\sunjce_provider.jar;D:\Java\JDK\jre\lib\ext\sunmscapi.jar;D:\Java\JDK\jre\lib\ext\sunpkcs11.jar;D:\Java\JDK\jre\lib\ext\zipfs.jar;D:\Java\JDK\jre\lib\javaws.jar;D:\Java\JDK\jre\lib\jce.jar;D:\Java\JDK\jre\lib\jfr.jar;D:\Java\JDK\jre\lib\jfxswt.jar;D:\Java\JDK\jre\lib\jsse.jar;D:\Java\JDK\jre\lib\management-agent.jar;D:\Java\JDK\jre\lib\plugin.jar;D:\Java\JDK\jre\lib\resources.jar;D:\Java\JDK\jre\lib\rt.jar;D:\JavaWorkSpace\day11\out\production\algorithm com.company.algorithm.link.LinkIsContainsRing
true
false

（3）快慢指针
让块指针比慢指针每次都快一步，如果存在环，则快指针和慢指针一定会相遇，如果不存在环，则遍历到链表尾部结束

package com.company.algorithm.link;

public class LinkIsContainsRing {

    public static void main(String[] args) {
        LinkIsContainsRing linkIsContainsRing = new LinkIsContainsRing();
        LinkNode hasRingLinkNode = linkIsContainsRing.createHasRingLink(new int[]{1, 2, 3, 4, 5, 6});
        LinkNode noRingLinkNode = linkIsContainsRing.createNoRingLink(new int[]{1, 2, 3, 4, 5, 6});
        System.out.println(linkIsContainsRing.linkIsContainsRing3(hasRingLinkNode));
        System.out.println(linkIsContainsRing.linkIsContainsRing3(noRingLinkNode));
    }

    //快慢指针
    private boolean linkIsContainsRing3(LinkNode head) {
        LinkNode slow = head;
        LinkNode quick = head;
        while (slow != null && quick != null) {
            slow = slow.getNext();
            if (quick.getNext() != null) quick = quick.getNext().getNext();
            else return false;
            if (slow == quick) return true;
        }
        return false;
    }

}

//节点类
class LinkNode {
    public int val;
    LinkNode nextNode;

    public LinkNode(int val) {
        this.val = val;
    }
}

运行结果

D:\Java\JDK\bin\java.exe "-javaagent:D:\IntelliJ IDEA 2019.3.3\lib\idea_rt.jar=10902:D:\IntelliJ IDEA 2019.3.3\bin" -Dfile.encoding=UTF-8 -classpath D:\Java\JDK\jre\lib\charsets.jar;D:\Java\JDK\jre\lib\deploy.jar;D:\Java\JDK\jre\lib\ext\access-bridge-64.jar;D:\Java\JDK\jre\lib\ext\cldrdata.jar;D:\Java\JDK\jre\lib\ext\dnsns.jar;D:\Java\JDK\jre\lib\ext\jaccess.jar;D:\Java\JDK\jre\lib\ext\jfxrt.jar;D:\Java\JDK\jre\lib\ext\localedata.jar;D:\Java\JDK\jre\lib\ext\nashorn.jar;D:\Java\JDK\jre\lib\ext\sunec.jar;D:\Java\JDK\jre\lib\ext\sunjce_provider.jar;D:\Java\JDK\jre\lib\ext\sunmscapi.jar;D:\Java\JDK\jre\lib\ext\sunpkcs11.jar;D:\Java\JDK\jre\lib\ext\zipfs.jar;D:\Java\JDK\jre\lib\javaws.jar;D:\Java\JDK\jre\lib\jce.jar;D:\Java\JDK\jre\lib\jfr.jar;D:\Java\JDK\jre\lib\jfxswt.jar;D:\Java\JDK\jre\lib\jsse.jar;D:\Java\JDK\jre\lib\management-agent.jar;D:\Java\JDK\jre\lib\plugin.jar;D:\Java\JDK\jre\lib\resources.jar;D:\Java\JDK\jre\lib\rt.jar;D:\JavaWorkSpace\day11\out\production\algorithm com.company.algorithm.link.LinkIsContainsRing
true
false