LeetCode——Linked List Cycle

最新推荐文章于 2023-06-06 23:37:14 发布

Seazzy5461

最新推荐文章于 2023-06-06 23:37:14 发布

阅读量203

点赞数

分类专栏： C++ Java LeetCode 文章标签： leetcode 链表

本文链接：https://blog.csdn.net/Hay54/article/details/78577455

版权

C++ 同时被 3 个专栏收录

48 篇文章 1 订阅

订阅专栏

LeetCode

24 篇文章 0 订阅

订阅专栏

Java

15 篇文章 0 订阅

订阅专栏

LeetCode——Linked List Cycle

#141

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

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

这一题的目的是判断链表中是否有环。一个思路是利用哈希表。如果遍历过的结点已经存在了哈希表，则说明有环。
先用java先，因为java中有hash结构，写起来比较方便。

Java

/**
 * 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> nodesSeen = new HashSet<>();
        while (head != null) {
            if (nodesSeen.contains(head)) {
                return true;
            } 
            else {
                nodesSeen.add(head);
            }
            head = head.next;
        }
        return false;
    }
}

还有一种解法，设置两个指针，一个一次走一步，一个一次走两步，如果存在环，则两个指针会相遇。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    bool hasCycle(ListNode *head) {
        ListNode *slow = head, *fast = head;
        while (fast && fast->next) {
            slow = slow->next;
            fast = fast->next->next;
            if (slow == fast) return true;
        }
        return false;
    }
};

Java

/**
 * 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, fast = head;
        while (fast != null && fast.next != null) {
            slow = slow.next;
            fast = fast.next.next;
            if (slow == fast) return true;
        }
        return false;
    }