摘要：
描述： Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2- 阅读全文
posted @ 2017-12-13 10:09
飘舞的雪
阅读(82)
评论(0)
推荐(0)
摘要：
描述： Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve 阅读全文
posted @ 2017-12-13 10:01
飘舞的雪
阅读(84)
评论(0)
推荐(0)
摘要：
描述： Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->nullptr, m = 2 and n = 4, return 1-> 阅读全文
posted @ 2017-12-13 09:51
飘舞的雪
阅读(97)
评论(0)
推荐(0)
浙公网安备 33010602011771号