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.
 * 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)
            return head;
        
        ListNode* temp1=NULL;
        ListNode* temp2=NULL;
        ListNode* pre=NULL;
        ListNode* Next = head;
        bool start = true;
        while (Next!=NULL && Next->next!=NULL){
            if (start == true){
                temp1 = head;
                temp2 = head->next;
                Next = head->next->next;
                temp2->next = temp1;
                pre =  temp1;
                head = temp2;
                start = false;
            }
            else{
                temp1 = Next;
                temp2 = Next->next;
                Next = Next->next->next;
                temp2->next = temp1;
                pre->next = temp2;
                pre = temp1;
            }
        }
        if (pre)
            pre->next = Next;
        return head;
    }
};

1. 开始时候

if (pre)
            pre->next = Next;

没有 if(pre)的判断，出错。因为没有考虑size为1的情况

另外不要忘写这个结尾部分，不然要不成circle link，要不少计算一个值