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.

解题思路参考： http://www.cnblogs.com/CarryPotMan/p/5343686.html

/**
 * 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) {
        if(head==NULL) return NULL;
        if(head->next==NULL) return head;
        ListNode* tmp=head;
        ListNode* fake_head;
        ListNode* pre=fake_head;
        ListNode* next;
        while(tmp && tmp->next){
            next=tmp->next;
            tmp->next=next->next;
            next->next=tmp;
            pre->next=next;
            pre=tmp;
            tmp=tmp->next;
        }
        return fake_head->next;
        
    }
};