[Careercup] 2.6 Linked The ring in the list cycle single-linked list

2.6 Given A circular linked list, implement an algorithm which returns the node at the beginning of the loop.
DEFINITION
Circular linked list:a (corrupt) linked list in which A node ' s next pointer points to an earlier node, so as to make A Lo Op in the linked list.
EXAMPLE
INPUT:A-> B-> C-> D-> E-> C [the same c as earlier]
Output:c

Leetcode in the original topic, see my previous blog Linked list cycle single linked list in the ring and Linked list Cycle II in the single linked list of the second.

[Careercup] 2.6 Linked The ring in the list cycle single-linked list