C++
/**
* 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) {
if(head == nullptr){
return nullptr;
}else if(head->next == nullptr){
return head;
}
ListNode * dumHead = new ListNode(0);
dumHead->next = head;
ListNode * cur = dumHead;
while(cur->next != nullptr && cur->next->next != nullptr){
ListNode * tmp = cur->next;
ListNode * tmp2 = cur->next->next->next;
cur->next = cur->next->next;
cur->next->next = tmp;
cur->next->next->next = tmp2;
cur = cur->next->next;
}
return dumHead->next;
}
};