2015年3月3日
【leetcode】Linked List Cycle II （middle）
摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?思路：... 阅读全文
posted @ 2015-03-03 20:35 匡子语 阅读(343) 评论(0) 推荐(0)
【leetcode】Copy List with Random Pointer (hard)
摘要： A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy ... 阅读全文
posted @ 2015-03-03 18:40 匡子语 阅读(299) 评论(0) 推荐(0)
【leetcode】Reverse Nodes in k-Group （hard）☆
摘要： Given a linked list, reverse the nodes of a linked listkat a time and return its modified list.If the number of nodes is not a multiple ofkthen left-o... 阅读全文
posted @ 2015-03-03 13:59 匡子语 阅读(245) 评论(0) 推荐(0)
【leetcode】Swap Nodes in Pairs （middle）
摘要： Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor... 阅读全文
posted @ 2015-03-03 10:21 匡子语 阅读(259) 评论(0) 推荐(0)