【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.
 */
#include <iostream>
#include <string>
#include <vector>
using namespace std;

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

//extern ListNode* createList(ListNode*head, int num);

ListNode* createList(ListNode*head, int num)
{
    ListNode* pl = head;

    ListNode* node = new ListNode(num);
    if (pl == NULL)
    {
        head = node;
    }
    else
    {
        while (pl->next != NULL)
        {
            pl = pl->next;
        }

        pl->next = node;
    }
    return head;
}

//leetcode思路
ListNode* swapPairs1(ListNode* head)
{
    if (head == NULL)
        return NULL;

    ListNode** p = &head, *a = NULL, *b = NULL;

    while ((a = *p) && (b = a->next))
    {
        a->next = b->next;
        b->next = a;
        *p = b; 
        p = &(a->next); 
    }   
    return head;
}

ListNode* swapPairs(ListNode* head)
{
    if (head == NULL)
        return NULL;

    ListNode* p = head, *rs1 = NULL, *a, *b;
    ListNode *rs2 = new ListNode(0);

    rs1 = rs2;
    while ((a = p) && (b= a->next))
    {
        p = b->next;
        b->next = a;
        a->next = p;

        rs2->next = b;
        rs2 = rs2->next->next;
    }

    rs2 = rs1;
    rs1 = rs1->next;
    delete rs2;
    return rs1;
}

int main()
{
    int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8 };

    ListNode* head1 = NULL, *rs = NULL;
    for (int i = 0; i < 8; i++)
    {
        head1 = createList(head1, arr[i]);      
    }
    rs = swapPairs(head1);
    while (rs)
    {       
        cout << rs->val << "    ";
        rs = rs->next;
    }

    system("pause");
    return 0;
}