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.

分析：注意第一个节点和奇数个node的处理
AC代码：

class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        ListNode* ret = NULL, *p = head, *q = NULL;
        while(p){
            ListNode* sec = p->next;
            if(!sec && !ret){
                return p;
            }
            p->next = sec->next;
            if(!ret){
                ret = sec;
                sec->next = p;
            }else{
                q->next = sec;
                sec->next = p;
            }
            q = p;
            p = p->next;
            if(!p || !p->next){
                return ret;
            }
        }
        return ret;
    }
};