leetcode24，交換鏈表相鄰的節點

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

>>阅读原文<<