leetcode-24

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.

#include<iostream>
using namespace std;


class Solution {
public:
ListNode* swapPairs(ListNode* head) {
        ListNode **pp = &head, *a, *b;  //链表节点交换至少需要三个指针
        while ((a = *pp) && (b = a->next)) {  //当*pp为NULL(空链表)或a->next为NULL(奇数个节点)时停止交换
            a->next = b->next;
            b->next = a;
            *pp = b;
            pp = &(a->next);
        }
        return head;  //采用**pp,让head一直为指向头结点的指针
    }
};