Leetcode:给定一个链表，每两个相邻节点交换一次，并返回它的指针。

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 not modify the values in the list, only nodes itself can be changed.

思路：遍历链表，对每一对相邻的两个节点执行链表反转操作，后返回新的头指针。

Java代码实现

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode swapPairs(ListNode head) {
        if(head == null || head.next == null)
            return head;
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        ListNode tmp, pre = dummy, cur = head;
        while(cur != null && cur.next != null){
            tmp = cur.next;
            cur.next = tmp.next;
            tmp.next = pre.next;
            pre.next = tmp;
            
           //跳到下一对节点
            pre = cur;
            cur = cur.next;
        }
        return dummy.next;
    }
}