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

solution：画出list模拟一下即可，需要注意的是要引进当前结点的前结点，因为每次swap之后，当前结点之前结点的next值也要变化。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *swapPairs(ListNode *head) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(head == NULL || head -> next == NULL)
            return head;
        
        ListNode *node = head;
        ListNode *newHead;
        ListNode *preNode = NULL;
        
        while(node -> next != NULL)
        {
            ListNode *temp = node -> next;
            ListNode *ne = temp -> next;
            if(node == head)
            {
                newHead = temp;
            }
            if(preNode != NULL)
                preNode ->next = temp;
            node -> next = temp -> next;
            temp -> next = node;
            preNode = node;
            node = node -> next;
            if(node == NULL)
                break;
        }
        
        return newHead;
    }
};