单链表的概念自行百度
下面是源码
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct play{
char name[10];
int number;
struct play *next;
}player; //构建一个单链表
player *build()
{
player *p1=(player *)malloc(sizeof(player)); //利用malloc 分配内存
player *p2=(player *)malloc(sizeof(player));
player *p3=(player *)malloc(sizeof(player));
player *head,*q;
int i=1;
head=p1;
p1->next=p2; p2->next=p3; p3->next=NULL; //链接起来
for(q=head;q;q=q->next,i++) //账号信息
{
q->number=i;
}
strcpy(p1->name,"死歌"); //名字
strcpy(p2->name,"剑圣");
strcpy(p3->name,"狗头");
return head;
}
player *Del()