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) {
        if(!head || !head->next)
            return head;
        ListNode * p1 = head;
        ListNode * p2 = head->next;
        ListNode * result = p2; 
        while(p1 && p2)
        {
            ListNode* p1_tmp = p2->next;
            if(p1_tmp == NULL){
                p1->next = NULL;
                p2->next = p1;
                return result;
            }
            ListNode* p2_tmp = p2->next->next;
            if(p2_tmp == NULL){
                p2->next = p1;
                p1->next = p1_tmp;
                return result;
            }
            else{
                p1->next = p2_tmp;
                p2->next = p1;
                p1 = p1_tmp;
                p2 = p2_tmp;
            }
        }
        return result;
    }
};