24. 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.

交换相邻的两个节点。两个相邻节点的交换是比较简单的，这里需要注意的地方在于，当前相邻节点交换后，如何与上一个节点连接在一起。因此可以通过一个额外的节点做连接功能（如程序示例中的pre节点）。程序如下：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode swapPairs(ListNode head) {
        if (head == null||head.next == null){
            return head;
        }
        ListNode pre = new ListNode(0);
        pre.next = head;
        ListNode retNode = head.next;
        ListNode fast = null, tmp = null;
        while (head != null){
            fast = head.next;
            if (fast == null){
                return retNode;
            }
            tmp = fast.next;
            fast.next = head;
            head.next = tmp;
            pre.next = fast;
            pre = head;
            head = tmp;
        }
        return retNode;
    }
}