LeetCode Swap Nodes in Pairs

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.

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
    ListNode *swapPairs(ListNode *head) {
        ListNode** curNext = &head;
    	while(NULL != *curNext && NULL != (*curNext)->next)
		{
			ListNode* temp = (*curNext)->next;
			(*curNext)->next = (*curNext)->next->next;
			temp->next = *curNext;
			*curNext = temp;
			curNext = &(*curNext)->next->next;
		}
		return head;
    }
};