Cracking the Coding Interview Q2.6
2014-07-08 00:18
281 查看
Given a circular linked list, implement an algorithm which returns 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 loop in the linked list.
EXAMPLE
Input: A -> B -> C -> D -> E -> C [the same C as earlier]
Output: C
参考：
/article/6570264.html
/article/6570265.html
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 loop in the linked list.
EXAMPLE
Input: A -> B -> C -> D -> E -> C [the same C as earlier]
Output: C
参考：
/article/6570264.html
/article/6570265.html
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Cracking the Coding Interview（Trees and Graphs）
- Cracking the coding interview--Q9.1
- Cracking the coding interview--Q4.7
- { Cracking The Coding Interview: 150 programming Q&A } 5th edition Part II
- Cracking the coding interview--Q8.6
- Cracking the coding interview--Q2.1
- Cracking the coding interview--Q5
- Cracking the Coding Interview Q1.5
- 《Cracking the Coding Interview》——第3章：栈和队列——题目5
- Cracking the Coding Interview Q1.6
- 《Cracking the Coding Interview》——第4章：树和图——题目8
- cracking the coding interview 中文版 （程序员面试金典）
- 《Cracking the Coding Interview》——第7章：数学和概率论——题目4
- Cracking the coding interview--问题与解答
- Cracking the coding interview--Q16.1-Q16.10
- Cracking the Coding Interview
- cracking the coding interview 中文版 （程序员面试金典）
- Cracking the coding interview--Q1.7
- Cracking The Coding Interview 1.1
- Cracking The Coding Interview 1.7