摘要: 题意: 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. Y 阅读全文
posted @ 2016-01-11 20:45 wangb021 阅读(130) 评论(0) 推荐(0)
摘要: http://blog.csdn.net/feike2008/article/details/5621354 待更 阅读全文
posted @ 2016-01-11 15:18 wangb021 阅读(257) 评论(0) 推荐(0)