2014年7月7日

CTCI 2.3

摘要： Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node.EXAMPLEInput: the node c from the linked... 阅读全文

posted @ 2014-07-07 23:40 中二病程序猿阅读(98) 评论(0) 推荐(0)

CTCI 2.2

摘要： Implement an algorithm to find the kth to last element of a singly linked list.Classical "Runner" Technique of linkedlist/*Use two pointers, forward o... 阅读全文

posted @ 2014-07-07 22:14 中二病程序猿阅读(146) 评论(0) 推荐(0)

CTCI 2.1

摘要： Write code to remove duplicates from an unsorted linked list.FOLLOW UPHow would you solve this problem if a temporary buffer is not allowed?/* Use a H... 阅读全文

posted @ 2014-07-07 21:14 中二病程序猿阅读(252) 评论(0) 推荐(0)

中二病程序猿
博客园首页新随笔联系订阅管理

2014年7月7日

公告