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.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode swapPairs(ListNode head) {
        if(head == null || head.next == null)
            return head;
        ListNode temp = head.next;
        head.next = temp.next;
        temp.next = head;
        ListNode node = temp.next.next;
        ListNode pre = temp.next;
        if (node == null)
            return temp;
        while (node.next != null) {
            System.out.println(node.val);
            ListNode t = node.next;
            node.next = t.next;
            t.next = node;
            pre.next = t;
            if(node.next == null)
                break;
            pre = node;
            node = node.next;
        }
        return temp;
    }
}