[leetcode] 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.

思路：交换前两个节点，然后递归解决

代码：

/**
 * 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) {
        while(head==NULL) return NULL;
        ListNode *pre=head,*cur=head->next,*post;
        if(cur==NULL) return head;
        ListNode *res;
        post=cur->next;
        cur->next=pre;
        pre->next=post;
        res=cur;
        pre->next=swapPairs(post);
        return res;
    }
};