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.

思路：主要是注意null的判断，如果后面没有两个元素了，就不需要进行交换了；也就是cur.next.next == null;

/**
 * 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) {
            return null;
        }
        ListNode dummpyNode = new ListNode(0);
        dummpyNode.next = head;
        ListNode pre = dummpyNode;
        ListNode cur = dummpyNode;
        ListNode next = dummpyNode;
        
        while(cur != null && cur.next != null) {
            cur = cur.next;
            next = cur.next;
            // swap; 因为while循环判断里面的cur.next 又上前走了一步，所以要判断是否为null；
            if(next != null) {
                pre.next = cur.next;
                cur.next = next.next;
                next.next = cur;
            }
            
            pre = cur;
        }
        return dummpyNode.next;
    }
}