LeetCode 141. Linked List Cycle

最新推荐文章于 2022-07-26 17:51:26 发布

David_DLUT

最新推荐文章于 2022-07-26 17:51:26 发布

阅读量213

点赞数

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

本文链接：https://blog.csdn.net/David_DLUT/article/details/53940854

版权

LeetCode 专栏收录该内容

42 篇文章 0 订阅

订阅专栏

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

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

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