Swap Nodes in Pairs

Given a linked list, swap every two adjacent nodes and return its head.html For example, Given 1->2->3->4, you should return the list as 2->1->4->3.node Your algorithm should use only constant space.

>>阅读原文<<