141 Linked List Cycle

dongbeier

于 2018-06-14 06:38:05 发布

阅读量98

点赞数

CC 4.0 BY-SA版权

分类专栏： MicroSoft LeetCode

本文链接：https://blog.csdn.net/dongbeier/article/details/80317517

LeetCode 同时被 2 个专栏收录

146 篇文章

订阅专栏

MicroSoft

85 篇文章

订阅专栏

本文介绍两种检测链表中是否存在循环的方法：一种是使用Set来记录遍历过的节点，空间复杂度为O(n)；另一种是利用快慢指针技巧，实现O(1)的空间复杂度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a linked list, determine if it has a cycle in it.

Follow up:
Can you solve it without using extra space?

使用Set做法. O(n) space:

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public boolean hasCycle(ListNode head) {
        Set<ListNode> seen = new HashSet<>();
        while (head != null) {
            if (seen.contains(head)) {
                return true;
            } else {
                seen.add(head);
                head = head.next;
            }
        }
        return false;
    }
}

使用slow, fast做法, O(1) space:

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public boolean hasCycle(ListNode head) {
        ListNode slow = head;
        ListNode fast = head;
        while (fast != null && fast.next != null) {
            slow = slow.next;
            fast = fast.next.next;
            if (slow == fast) {
                return true;
            }
        }
        return false;
    }
}