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:
    void swap(ListNode* node1,ListNode* node2){
        node1->next = node2->next;
        node2->next = node2->next->next;
        node1->next->next = node2;
    }
    ListNode* swapPairs(ListNode* head) {
        ListNode * dummy = new ListNode();
        dummy->next = head;
        ListNode* p = dummy;
        while(p->next&&p->next->next){
            swap(p,p->next);
            p = p->next->next;
        }
        head = dummy->next;
        delete dummy;
        return head;
    }
};

 代码随想录：