2015年3月12日
【leetcode】Reverse Linked List II （middle）
摘要： 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 @ 2015-03-12 21:36 匡子语 阅读(199) 评论(0) 推荐(0)
【leetcode】Partition List（middle）
摘要： 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 @ 2015-03-12 20:33 匡子语 阅读(166) 评论(0) 推荐(0)
【leetcode】Merge Two Sorted Lists（easy）
摘要： Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.思路：使用伪头部c... 阅读全文
posted @ 2015-03-12 20:21 匡子语 阅读(142) 评论(0) 推荐(0)