1.力扣C源码
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
bool hasCycle(struct ListNode *head) {
if (head == NULL) {
return false;
}
else {
struct ListNode* fast = head;
struct ListNode* slow = head;
while (true) {
if (fast->next == NULL || fast->next->next == NULL) {
return false;
}
else {
fast = fast->next->next;
slow = slow->next;
}
if (fast == slow