力扣24. 两两交换链表中的节点

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        ListNode* dummyhead = new ListNode(0, head);
        ListNode* cur = dummyhead;
        while(cur->next && cur->next->next) {
            ListNode* tmp = cur->next;
            cur->next = cur->next->next;
            ListNode* tmp2 = cur->next->next;
            cur->next->next = tmp;
            cur = tmp;
            cur->next = tmp2;
        }
        ListNode* result = dummyhead->next;
        delete dummyhead;
        return result;
    }
};