链表创建和逆序

#include <stdio.h>
#include <stdlib.h>

#define LINK_LENGTH 15

typedef struct _Node
{
    int data;
    struct _Node *next;
}Node, *NodePtr;

void CreateLinklist(NodePtr pHead)
{
    NodePtr pPrev, pCurr;
    int i = 0;
    pPrev = pHead;
    for(i = 0; i < LINK_LENGTH; i++)
    {
        pCurr = (NodePtr)malloc(sizeof(Node));
        pCurr->data = i + 1;
        pCurr->next = NULL;
        pPrev->next = pCurr;
        pPrev = pCurr;
    }
}

void ReverseLinklist(NodePtr pHead)
{
    NodePtr pCurr, pTmp;

    pCurr = pHead->next;
    pHead->next = NULL; // Empty the original linklist
    while(pCurr != NULL)
    {
        pTmp = pCurr->next;
        // Insert to head
        pCurr->next = pHead->next;
        pHead->next = pCurr;
        pCurr = pTmp;
    }
}

void PrintLinklist(NodePtr pHead)
{
    NodePtr pCurr = pHead->next;

    while(pCurr != NULL)
    {
        printf("%d ", pCurr->data);
        pCurr = pCurr->next;
    }
    printf("\n");
}

int main()
{
    NodePtr pHead = NULL;
    pHead = (NodePtr)malloc(sizeof(Node));
    pHead->data = -1; // Head always not in real linklist.
    pHead->next = NULL;
    CreateLinklist(pHead);

    printf("Original Linklist: ");
    PrintLinklist(pHead);

    // Reverse
    ReverseLinklist(pHead);
    printf("Reversed Linklist: ");
    PrintLinklist(pHead);

    system("pause");
    return 0;
}