摘要: 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 as 2->1->4->3. Your a 阅读全文
posted @ 2016-05-11 15:31 梦幻之海 阅读(201) 评论(0) 推荐(0)