2015年5月10日
cc150 Chapter 2 | Linked Lists 2.6 Given a circular linked list, implement an algorithm which returns node at the beginning of the loop.
摘要： 2.6Given a circular linked list,implement an algorithm which returns the node at the beginning of the loop. 快指针和慢指针一起在头指针开始移动，快指针每次移动两步，慢指针每次移动一步，直到相遇... 阅读全文
posted @ 2015-05-10 14:09 爱刷题的小盒子 阅读(395) 评论(0) 推荐(0) 编辑
cc150 Chapter 2 | Linked Lists 2.5 add two integer LinkedList, return LinkedList as a sum
摘要： 2.5 You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the ... 阅读全文
posted @ 2015-05-10 11:59 爱刷题的小盒子 阅读(192) 评论(0) 推荐(0) 编辑