LeetCode 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 *dummyNode = new ListNode(0);
        dummyNode->next = head;
        ListNode *temp = dummyNode;
        while(temp->next != nullptr && temp->next->next != nullptr){
            ListNode *node1 = temp->next;
            ListNode *node2 = temp->next->next;
            node1->next = node2->next;
            temp->next = node2;
            node2->next = node1;
            temp = node1;
        }
        ListNode* res = dummyNode->next;
        delete dummyNode;   //防止内存泄漏
        return res;
    }
};