摘要：
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 @ 2014-10-29 22:18
vincently
阅读(121)
评论(0)
推荐(0)
摘要：
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 @ 2014-10-29 17:50
vincently
阅读(157)
评论(0)
推荐(0)
摘要：
Given a linked list, remove thenthnode from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After re... 阅读全文
posted @ 2014-10-29 17:12
vincently
阅读(193)
评论(0)
推荐(0)
摘要：
Given a list, rotate the list to the right bykplaces, wherekis non-negative.For example:Given1->2->3->4->5->NULLandk=2,return4->5->1->2->3->NULL.思路一：首... 阅读全文
posted @ 2014-10-29 16:54
vincently
阅读(186)
评论(0)
推荐(0)
摘要：
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-... 阅读全文
posted @ 2014-10-29 15:06
vincently
阅读(117)
评论(0)
推荐(0)
摘要：
Given a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2, return1->2.Given1->1->2->3->3, retu... 阅读全文
posted @ 2014-10-29 14:19
vincently
阅读(158)
评论(0)
推荐(0)
摘要：
Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi... 阅读全文
posted @ 2014-10-29 13:58
vincently
阅读(167)
评论(0)
推荐(0)
浙公网安备 33010602011771号