摘要：
题意： 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 阅读全文
摘要：
http://blog.csdn.net/feike2008/article/details/5621354 待更 阅读全文