LeetCode 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.

代码

/**
 * 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) {
        ListNode dummy(-1);
        ListNode* rear = &dummy;
        ListNode* temp, *p = head;
        int flag = 0;
        while(p)
        {
            if(!flag)
            {
                temp = p;
                flag = 1;
                p = p->next;
            }
            else
            {
                rear = rear->next = p;
                p = p->next;
                rear = rear->next = temp;
                flag = 0;
                //p = p->next; 一开始放在这里，大错特错啊，耽误很多时间
            }
        }
        if(flag) rear = rear->next = temp;
        rear->next = NULL;
        return dummy.next;
    }

    //高分参考答案，时间复杂度降低一半，利用ListNode **pp指针先指向节点，后指向节点的next域
    ListNode* swapPairs(ListNode* head) {
    ListNode **pp = &head, *a, *b;
    while ((a = *pp) && (b = a->next)) {
        a->next = b->next;
        b->next = a;
        *pp = b;
        pp = &(a->next);
    }
    return head;
    }

};

总结

高分参考答案的思路 链接：

• Pointer-pointer pp points to the pointer to the current node.
  So at first, pp points to head, and later it points to the next field of ListNodes.
  Additionally, for convenience and clarity, pointers a and b point to the current node and the next node.

• We need to go from *pp == a -> b -> (b->next) to *pp == b -> a -> (b->next).
  The first three lines inside the loop do that, setting those three pointers (from right to left).
  The fourth line moves pp to the next pair.