摘要：
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 prese... 阅读全文
摘要：
iven a linked list, swap every two adjacent nodes and return its head.For example, Given 1->2->3->4, you should return the list as 2->1->4->3... 阅读全文