两两交换链表中的节点

本文参考代码随想录

使用虚拟头结点
初始时cur指向虚拟头结点

1. cur->2
2. 2->1
3. 1->3

/**
 * 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);
        dummyHead->next = head;
        ListNode* cur = dummyHead;
        while(cur->next != nullptr && cur->next->next != nullptr){
            ListNode* tmp = cur->next;//1
            ListNode* tmp1 = cur->next->next->next;//3

            cur->next = cur->next->next;//cur->2
            cur->next->next = tmp;//2->1
            cur->next->next->next = tmp1;//1->3

            cur = cur->next->next;
        }
        ListNode* result = dummyHead->next;
        delete dummyHead;
        return result;

    }
};

时间复杂度O(1)
空间复杂度O(1)