链表的创建

#include <stdio.h>
#include <stdlib.h>
struct Student
{
        int data;
        struct Student * next;
};

struct Student * Create_list(); //创建链表函数
void Delete_list(struct Student *);//输出链表函数
int main()
{
        struct Student * phead;
        phead = Create_list();
        Delete_list(phead);
        return 0;
}

struct Student * Create_list()
{
        struct Student * phead, *pend, *pnew;
        phead = (struct Student *)malloc(sizeof(struct Student));
        if(phead == NULL)
        {   
                printf("内存分配失败!\n");
                exit (EXIT_FAILURE);    //返回非0值
        }   
        pend = phead;
        pend->next = NULL;

        do  
        {   
                pnew = (struct Student *)malloc(sizeof(struct Student));
                if(pnew == NULL)
                {   
                        printf("内存分配失败!\n");
                        exit (EXIT_FAILURE);
                }   
                printf("请输入数据(输入0时退出输入):");
                scanf("%d", &pnew->data);
                if(pnew->data != 0)
                {
                        pend->next = pnew;
                        pend = pnew;
                        pend->next = NULL;
                }
        }while(pnew->data != 0);
        free(pnew);     //释放刚才创建的空间,因为它的值为零
        return phead;
}

void Delete_list(struct Student *phead)
{
        phead = phead->next;
        while(phead)
        {
                printf("%d\n", phead->data);
                phead = phead->next;
        }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值