Leetcode 141. Linked List Cycle

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

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

Reference

1. https://leetcode.com/problems/linked-list-cycle/description/