2014年6月7日
LeetCode OJ - Reverse Linked List II
摘要： 题目：Reverse a linked list from positionmton. Do it in-place and in one-pass.For example:Given1->2->3->4->5->NULL,m= 2 andn= 4,return1->4->3->2->5->NULL... 阅读全文
posted @ 2014-06-07 17:45 ThreeMonkey 阅读(155) 评论(0) 推荐(0)
LeetCode OJ - Partition List
摘要： 题目：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 or... 阅读全文
posted @ 2014-06-07 10:01 ThreeMonkey 阅读(194) 评论(0) 推荐(0)