标签：slow point pointers list meet pointer cycle

The blog aims to provide a sound proof for the approach to solve leetcode 142.

Problem

　　Given a linked list, return the node where the cycle begins. If there is no cycle, return null.

Most programmers know that the fast/slow pointers approach is able to detect cycle in a singly linked list. If two pointers finally meet somewhere then we are sure a cycle exists. And if we set one pointer at the list head and another at meeting point and let them go in the same speed, then they will meet again at the starting point of the cycle.

Does this approach work? I will try to give you a proof of it.

See the graph above, let L, M, N denote distance. Now let's suppose the fast pointer travels x times in the cycle and the slow one go around the cycle y times when they meet, then the following equation holds:

L+M+(M+N)x=2[L+M+(M+N)y]

After some cancelling we could get:

L=N+(M+N)(x-2y-1)

What does it mean? Remember the method to find the start point? The first pointer starts at the list head and the second starts at meeting point, when the first arrives at the cycle start, it travels for L distance, and the second pointer in the meantime travels several rounds of the cycle plus N distance. It's guaranteed they would meet at the cycle start.

In a tiktok interview the interviewer asked me to prove the correctness of the algorithm and this was my solution.

标签：slow,point,pointers,list,meet,pointer,cycle
来源： https://www.cnblogs.com/shepherdgai/p/13567343.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。