摘要: 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 @ 2017-10-22 20:48 乐乐章 阅读(111) 评论(0) 推荐(0) 编辑