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 == NULL || head->next == NULL) return head;  //0个或1个
        ListNode *p = head, *q = head->next;
        head = q; p->next = q->next; head->next = p; 
        q = p->next;
        //p指向左节点的前驱节点,q指向右节点的前驱节点（即左节点）
        while(q && q->next){ 
            p->next = q->next;  
            ListNode* r = q->next->next;
            q->next->next = q;
            q->next = r;
            p = p->next->next; q = p->next;
        }
        return head;
    }
};