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.

Subscribe to see which companies asked this question

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