摘要: Swap Nodes in Pairs Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list a 阅读全文
posted @ 2016-03-08 11:23 `Liok 阅读(587) 评论(0) 推荐(0) 编辑