判断链表是否有环

怕下次找不到了？快快点关注鼓励一下嘛~ (╹▽╹) ~
题目：判断给定的链表中是否有环。如果有环则返回true，否则返回false

解答

public class HasRing {
    static class ListNode {
        int val;
        ListNode next;
        ListNode(int x) {
            val = x;
            next = null;
        }
    }
    
    public boolean hasCycle(ListNode head) {
        //定义快慢指针，使他们都指向链表头部
        ListNode fast = head;
        ListNode slow = head;
        //当head不为空且head不是无环单节点时
        while(fast != null && fast.next != null)
        {
            //快指针每次向前移动两个
            fast = fast.next.next;
            //慢指针每次向前移动一个
            slow = slow.next;
            //如果链表有环，那么他们一定有相遇的时候
            if(slow == fast)
                return true;
        }
        return false;
    }
    
    public static void main(String[] args) {
        HasRing hasRing = new HasRing();
        ListNode n1 = new ListNode(1);
        ListNode head = n1;
        ListNode n2 = new ListNode(2);
        ListNode n3 = new ListNode(3);
        ListNode n4 = new ListNode(4);
        ListNode n5 = new ListNode(5);

        n1.next = n2;
        n2.next = n3;
        n3.next = n4;
        n4.next = n5;
        n5.next = n1;//构建一个有环的链表

        System.out.println(hasRing.hasCycle(head));
    }
}

如果文章内容对您有帮助的话，欢迎点赞加关注哦！比心