交换链表的奇偶位（比如1和2，3和4，5和6。。。交换）
题目：Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algorithm should use only constant space. You may
