linked list cycle c++
class Solution {
public:
bool hasCycle(ListNode *head) {
unordered_set<ListNode*> visited;
if (head == NULL) {
return false;
}
while (head) {
if (visited.count(head)) {
return true; // has appeared before
}
visited.insert(head);
head = head->next;
}
return false;
}
};Linked List Cycle
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).Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
