LeetCode | 141. Linked List Cycle

最新推荐文章于 2024-09-16 06:54:08 发布

1LOVESJohnny

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量79

点赞数

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

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/108891421

版权

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

该博客讨论了如何检查单链表中是否存在环。通过使用快慢指针（Floyd 算法）来确定链表的头部是否指向环内，如果快指针追上慢指针则说明存在环，否则不存在。题目给出了若干示例输入和相应的输出，包括环的位置。此外，还提出了额外挑战，即在 O(1) 内存限制下解决此问题。

摘要由CSDN通过智能技术生成

题目：

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

There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to. Note that pos is not passed as a parameter.

Return true if there is a cycle in the linked list. Otherwise, return false.

Follow up:

Can you solve it using O(1) (i.e. constant) memory?

Example 1:

Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where the tail connects to the 1st node (0-indexed).

Example 2:

Input: head = [1,2], pos = 0
Output: true
Explanation: There is a cycle in the linked list, where the tail connects to the 0th node.

Example 3:

Input: head = [1], pos = -1
Output: false
Explanation: There is no cycle in the linked list.

Constraints:

The number of the nodes in the list is in the range [0, 104].
-105 <= Node.val <= 105
pos is -1 or a valid index in the linked-list.

代码：

/**
 * 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 *p, *q;
        p = q = head;
        while(p != NULL && q != NULL)
        {
            p = p->next;
            q = q->next;
            if(q == NULL)
                break;
            q = q->next;
            if(p == q)
                return true;
        }
        return false;
    }
};