Linked List Cycle III
Prereq: Linked List Cycle
This question is the same as Linked List Cycle, except in addition to checking whether a linked list has a loop, we also find the entry point to the loop, if possible.
Parameters
nodes: The first node of a linked list with potentially a loop.
Result
- An integer representing the value contained by the entry point to the loop,
if there is one. If there is no loop,
output
-1.
Examples
Example 1
Input:
Output:
1
Example 2
Input:
Output:
-1
Constraints
1 <= len(nodes) <= 10^5