2014年12月2日
[LeetCode] 142. 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 阅读全文
posted @ 2014-12-02 14:10 Grandyang 阅读(24021) 评论(17) 推荐(1)
[LeetCode] 141. Linked List Cycle 单链表中的环
摘要： Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked list, we use an integer pos which represents the posi 阅读全文
posted @ 2014-12-02 13:23 Grandyang 阅读(17567) 评论(3) 推荐(0)
Fork me on GitHub