leetcode24——Swap Nodes in Pairs

题目大意：给出一个链表，交换链表中相邻的两个节点

分析：两个一组翻转链表。

代码：

/**
 * 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) {
        ListNode* dummy = new ListNode(0);
        ListNode* pre = dummy;
        dummy->next = head;
        while(head && head->next){
            ListNode* p = pre->next;
            pre->next = head->next;
            head->next = pre->next->next;
            pre->next->next = p;
            pre = head;
            head = head->next;
        }
        return dummy->next;
    }
};