Problem
Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.
There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail’s next pointer is connected to (0-indexed). It is -1 if there is no cycle. Note that pos is not passed as a parameter.
Do not modify the linked list.
Constraints:
- The number of the nodes in the list is in the range
[0, 104]. -105 <= Node.val <= 105posis-1or a valid index in the linked-list.
Solution
C++
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
ListNode *detect_linkedList_cycle::detectCycle(ListNode *head) {
int i = -1;
ListNode* node = head;
std::map<ListNode*, int> m;
while (node != nullptr) {
i++;
std::map<ListNode *, int>::iterator iter = m.find(node->next);
if (iter != m.end()) {
return iter->first;
}
m[node] = i;
node = node->next;
}
return nullptr;
}
References
https://leetcode.com/problems/linked-list-cycle-ii/description/?envType=study-plan&id=level-1