LeetCode 024. Swap Nodes in Pairs

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.

这道题交换node不难，关键是前一对node交换完之后，还必须记录前一对后一个节点的地址，以便其next直线下一对节点的前一个node.

如下图所示，交换后，2节点指向1节点，2节点此时成为头结点。1节点指向下一对节点的首节点。将这些关系缕清了也就不难了，都是指针操作。

代码如下：

/**
 * 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)
            return NULL;
        struct ListNode * p = head;
        struct ListNode * q = NULL;
        struct ListNode * prev = NULL;
        if(head->next)
            head = head->next; //第二个节点将变成头结点
        else
            return head;

        while(p->next)
        {
            q = p->next;
            p->next = q->next;
            q->next = p;
            prev = p;
            if(p->next && p->next->next)
            {
                p = p->next;
                prev->next = p->next;
            }
            else 
                break;
        }
        
        return head;
    }
};