LeetCode24. 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.

#include<cstdlib>

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        ListNode *p1,*p2,*p3;
        int first=0;
        p1=head;
        if(p1==NULL) {return head;}
        p2=p1->next;
        while(p1&&p2){
            first=p1->val;
            p1->val=p2->val;
            p2->val=first;

            p1=p2->next;
            if(p1==NULL) {return head;}
            p2=p1->next;

        }

        return head;
    }
};