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 || head->next == nullptr) {
return head;
}
ListNode* helper = head->next;
ListNode* prev = nullptr;
while(head and head->next) {
if (prev != nullptr) {
prev->next = head->next;
}
prev = head;
ListNode* nextNode = head->next->next;
head->next->next = head;
head->next = nextNode;
head = nextNode;
}
return(helper);
}
};