mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 14:57:08 +00:00
Time: 254 ms (5.13%), Space: 8.1 MB (25.73%) - LeetHub
This commit is contained in:
@@ -0,0 +1,27 @@
|
||||
/**
|
||||
* Definition for singly-linked list.
|
||||
* struct ListNode {
|
||||
* int val;
|
||||
* struct ListNode *next;
|
||||
* };
|
||||
*/
|
||||
bool hasCycle(struct ListNode *head) {
|
||||
struct ListNode *current = head;
|
||||
int index = 0;
|
||||
while (current) {
|
||||
struct ListNode *follow = head;
|
||||
int follow_index = 0;
|
||||
while (follow != current) {
|
||||
follow = follow->next;
|
||||
++follow_index;
|
||||
}
|
||||
|
||||
if (follow_index < index) {
|
||||
return true;
|
||||
}
|
||||
|
||||
current = current->next;
|
||||
++index;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
Reference in New Issue
Block a user