文章作者：Tyan
博客：noahsnail.com | CSDN | 简书
1. Description
Swap Nodes in Pairs
2. Solution
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* swapPairs(ListNode* head) {
if(!head || !head->next) {
return head;
}
ListNode* latter = head->next;
head->next = swapPairs(latter->next);
latter->next = head;
return latter;
}
};
