摘要: Given a linked list, swap every two adjacent nodes and return its head. For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algo... 阅读全文
posted @ 2014-12-08 19:23 bingtel 阅读(136) 评论(0) 推荐(0) 编辑