C++
哈希
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
unordered_set<ListNode *> unset;
while(head != nullptr){
if(unset.contains(head)){
return head;
}
unset.insert(head);
head = head->next;
}
return nullptr;
}
};
快慢指针:
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
ListNode *slow = head;
ListNode *fast = head;
while (fast != nullptr && fast->next != nullptr) {
slow = slow->next;
fast = fast->next->next;
if (slow == fast) {
break;
}
}
if (fast == nullptr || fast->next == nullptr) {
return nullptr;
}
slow = head;
while (slow != fast) {
slow = slow->next;
fast = fast->next;
}
return slow;
}
};