GoLang Solution For LeetCode Problem: Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.
To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.
Note: Do not modify the linked list.
Input: head = [3,2,0,-4], pos = 1 Output: tail connects to node index 1 Explanation: There is a cycle in the linked list, where tail connects to the second node.
Input: head = [1,2], pos = 0 Output: tail connects to node index 0 Explanation: There is a cycle in the linked list, where tail connects to the first node.
Input: head = , pos = -1 Output: no cycle Explanation: There is no cycle in the linked list.
x1 + x2 + x3 + x2 = 2 * (x1 + x2)
See the full details of the problem Linked List Cycle II at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go