【程序练习】——链表逆置

头插法逆置单向链表

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

typedef struct node{
    int item;
    struct node *next;
}node;

void list_show(node *);

//创建一个长度为10的链表
node *creat_node_list()
{
    node *h,*p,*l;
    int n = 10;
    h = (node *)malloc(sizeof(node));
    h->item = 10;
    h->next = NULL;

    p = h;

    while(--n){
        l = (node *)malloc(sizeof(node));
        l->item = n;
        l->next = NULL;
        p->next = l;
        p = l;
    }
    return h;
}

//逆置链表，头插法
node *tran_list(node *h)
{
    node *p,*l;
    p = NULL;
    l = NULL;
    
    while(h != NULL){
        p = h->next;
        h->next = l;
        l = h;
        h = p;
    }
    return l;
}

void list_show(node *p)
{
    while(p != NULL){
        printf("%d	",p->item);
        p = p->next;
    }
    printf("
");
}

int main(void)
{
    node *h;
    h = creat_node_list();
    list_show(h);
    h = tran_list(h);
    list_show(h);
    return 0;
}

运行结果：