【C语言】单向链表 头插法

来源:互联网 发布:杭州阿里云公司地址 编辑:程序博客网 时间:2024/06/06 00:05
#include<stdio.h>#include<stdlib.h>int main(){    struct list{        int num;        struct list* prior;    };    char key;    struct list *head = NULL;    struct list *last = NULL;    struct list *p = NULL;    printf("do u want to write ur data?\n");    scanf("%c", &key);    while(key == 'y')    {    p = (struct list*)malloc(sizeof(struct list));    if(!p)        printf("no enough memory \n");            printf("in out ur data\n");    scanf("%d", &p->num);    p->prior = NULL;    if(head == NULL)    {        head = p;        last = p;    }    else    {        p->prior = head;                               //新建节点的上一个节点指向头结点        head = p;                                           //始终令新建节点为头结点    }    printf("\ndo u want to continue?\n");    scanf(" %c", &key);        }while(head!= NULL){    printf("%d", head->num);    head = head->prior;}    return 0;}

0 0
原创粉丝点击