【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，如需轉載請自行聯系原作者