Explain how finding cycle start node in cycle linked list work?
问题 I understand that Tortoise and Hare\'s meeting concludes the existence of loop, but how does moving tortoise to beginning of linked list while keeping the hare at meeting place, followed by moving both one step at a time make them meet at starting point of cycle? 回答1: This is Floyd's algorithm for cycle detection. You are asking about the second phase of the algorithm -- once you've found a node that's part of a cycle, how does one find the start of the cycle? In the first part of Floyd's