实现某个单链表的逆序

/*
 * =====================================================================================
 *
 *       Filename:  single_link.c
 *
 *    Description:  实现某个单链表的逆序。
 *
 *        Version:  1.0
 *        Created:  03/09/2012 04:30:01 PM
 *       Revision:  none
 *       Compiler:  gcc
 *
 *         Author:  Mr. He Wei Ping (hwp), [e-mail]
 *        Company:
 *
 * =====================================================================================
 */
#ifndef SINGLE_LINK_H
#define SINGLE_LINK_H

typedef struct node{
    int data;
    struct node *pNext;
}node_t;

node_t *make_node(int value);
node_t *insert(node_t *head, node_t *node);
node_t *invert(node_t *head);


#endif
~
~
#include <stdlib.h>
#include "single_link.h"

node_t *make_node(int value)
{
    node_t *p = (node_t *)malloc(sizeof(node_t));
    if(p)
    {
        p->data = value;
        p->pNext = NULL;
    }
    return p;
}

node_t *insert(node_t *head, node_t *node)
{
    node->pNext = head;
    head = node;
    return head;
}

node_t *invert(node_t *head)
{
    node_t *prev, *cur, *next;

    if(head == NULL || head->pNext == NULL)
        return head;

    prev = head;
    cur = next = head->pNext;
    while(cur)
    {
        next = cur->pNext;
        cur->pNext = prev;
        prev = cur;
        cur = next;
    }
    head->pNext = NULL;
    head = prev;
    return head;
}

void show(node_t *head)
{
    node_t *p = head;
    while(p)
    {
        printf("--%d--\n", p->data);
        p = p->pNext;
    }
}
#ifdef DEBUG
int main(void)
{
    int i;
    node_t *head = NULL;

    for(i = 0; i < 3; i ++)
    {
        head = insert(head, make_node(i+1));
    }
    show(head);
    show(invert(head));
    return 0;
}
#endif