【LeetCode】Swap Nodes in Pairs

题目

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 algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.

解答

构造了一个指向表头的结点，然后把表头当作普通结点直接遍历

---EOF---

本文转自mfrbuaa博客园博客，原文链接：http://www.cnblogs.com/mfrbuaa/p/5102155.html，如需转载请自行联系原作者