leetcode 24. Swap Nodes in Pairs

Description:
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.

把链表中相邻的每两个节点两两互换，只使用O（1）空间复杂度

Solution:
1、先考虑特殊情况，节点个数为0或者1
2、直接取出要交换的两个节点，注意指针的挪用就好了。

Code:

class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        if(head==NULL)
            return head;
        else if(head->next==NULL)
            return head;
        else
        {
            ListNode* temp=head;
            temp=head->next->next;
            ListNode* t=head->next;
            t->next=head;
            head->next=temp;
            ListNode* pre=head;//firstly swap the first two nodes.
            while(temp&&temp->next)
            {
                ListNode* tt=temp->next;//tt represents the second node
                temp->next=tt->next;//1st->3rd
                tt->next=temp;//2nd->1st
                pre->next=tt;//pre->1st
                pre=temp;
                temp=temp->next;
            }
            return t;
        }
    }
};