LeetCode OJ - 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) return NULL;
        if(!head->next) return head;
        
        ListNode dummy(0); 
        dummy.next = head;
        
        ListNode *last = &dummy;
        ListNode *cur = dummy.next;
        ListNode *next = cur->next;
        while(next) {
            next = cur->next;
            cur->next = next->next;
            next->next = cur;
            last->next = next;
            
            if(!cur->next) break;
            else if(!cur->next->next) break;
            
            last = cur;
            next = cur->next->next;
            cur = cur->next;
        }
        return dummy.next;
    }
};

分析：此处维护了last、cur、next三个指针，写的代码感觉任然不漂亮。此类题可虑使用dummy头节点，关键在于建立一个同一模型，不漏掉任何节点。