LeetCode Algorithms #24 <Swap Nodes in Pairs>

Given a linked list, swap every two adjacent nodes and return its head.

For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.

Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.

Subscribe to see which companies asked this question

思路：

发现转换第n个和第n+1个的位置需要先得到转换第n+2与第n+3的结果，所以想到使用递归。

解：

/**
 * 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 == nullptr || head->next == nullptr)
            return head;
        
        ListNode* stepNode = head->next;
        head->next = swapPairs(head->next->next);
        stepNode->next = head;
        
        return stepNode;
    }
};