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.

非递归的方法，使用三个指针和dummy头结点

class Solution {
public:
    ListNode *swapPairs(ListNode *head) {
        if(!head)
            return NULL;
        if(!head->next)
            return head;
        
        ListNode *dummy = new ListNode(INT_MAX);
        dummy->next = head;
        ListNode *prev = dummy;
        ListNode *cur = head;
        ListNode *next = cur->next;
        while(next)
        {
            prev->next = next;
            cur->next = next->next;
            next->next = cur;
            
            prev = cur;
            if(cur->next)
            	cur = cur->next;
            next = cur->next;
        }
        
        return dummy->next;
        
    }
};

递归

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

据说这是当年自己第一次完全自己写的AC代码

非递归的方法已经完全记不清是怎么写的了。。。。。

/**
 * 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 == 0)
        return 0;
    if(head->next == 0)
        return head;
    
    ListNode * firstPtr = head -> next;
    ListNode * secondPtr = head;
    ListNode * prePtr;
    
    while(firstPtr)
    {
        ListNode * tmpFirstPtr = firstPtr;
        ListNode * tmpSecondPtr = secondPtr;
        
        if(firstPtr ->next == 0 || firstPtr ->next -> next == 0)
           firstPtr = 0;
        
        else if(firstPtr -> next != 0 && firstPtr ->next -> next != 0)
        {
            firstPtr = firstPtr ->next -> next;
            secondPtr = secondPtr ->next -> next;
        }
        
        ListNode *  tmpPtr1 = tmpFirstPtr ->next;
        
        if(tmpSecondPtr == head)
        {
            head = tmpFirstPtr;
            tmpFirstPtr -> next = tmpSecondPtr;
            tmpSecondPtr -> next = tmpPtr1;
            prePtr = tmpSecondPtr;
        }
        else
        {
        prePtr -> next = tmpFirstPtr;
        tmpFirstPtr -> next = tmpSecondPtr;
        tmpSecondPtr -> next = tmpPtr1;
        prePtr = tmpSecondPtr;
        }
        
        
        
    }
    
    return head;
}
};