/**
* 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){
return nullptr;
}
if (!head->next){
return head;
}
ListNode *p = head;
ListNode *q = head->next;
ListNode *h = head->next->next;
q->next = p;
p->next = swapPairs(h);
return q;
}
};