c语言链表问题,C语言链表问题

这是我以前研究书上的一个例子 希望对你有帮助 有问题再说

#include

#define NULL 0

#define LEN sizeof(struct student)

struct student

{

long id;

float score;

struct student *next;

};

int n; /*全局变量，记录结点数*/

struct student *creat(void)  /*链表创建*/

{

struct student *head;

struct student *p1,*p2;

n=0;

p1=p2=(struct student *)malloc(LEN);

scanf(“%ld,%f”,&p1->id,&p1->score);

head=NULL;

while(p1->id!=0)

{

n++;

if(n==1)

head=p1;

else

p2->next=p1;

p2=p1;

p1=(struct student *)malloc(LEN);

scanf(“%ld,%f”,&p1->id,&p1->score);

}

p2->next=NULL;

return (head);

}

void print(struct student *head) /*输出链表*/

{

struct student *p;

printf(“\nNow,the %d records are: \n”,n);

p=head;

if(head!=NULL)

{

do

{

printf(“%ld %5.1f\n”,p->id,p->score);

p=p->next;

}while(p!=NULL);

}

}

struct student *del(struct student *head,long num) /*删除结点函数*/

{

struct student *p1,*p2;

if(head==NULL)

{

printf(“\nList null!\n”);

/*goto end; 生平第一次用*/

}

p1=head;

while(num!=p1->id && p1->next!=NULL)

{

p2=p1;

p1=p1->next;

}

if(num==p1->id) /*删除点*/

{

if(p1==head)

head=p1->next;

else

p2->next=p1->next;

printf(“delete:%d\n”,num);

n–;

}

else

printf(“%ld is not been found!\n”,num);

return(head);

}

struct student *insert(struct student *head,struct student *stud) /*插入结点*/

{

struct student *p0,*p1,*p2;

p1=head;

p0=stud;

if(head==NULL)

{

head=p0;

p0->next=NULL;

}

else

{

while((p0->id > p1->id) && (p1->next!=NULL))

{

p2=p1;

p1=p1->next;

}

if(p0->id <= p1->id)

{

if(head==p1)

{

head=p0;

p0->next=p1;

}

else

{

p2->next=p0;

p0->next=p1;

}

}

else

{

p1->next=p0;

p0->next=NULL;

}

}

}

main()

{

struct student *head,*stu;

long del_id;

printf(“input records:\n”);

head=creat();

print(head);

printf(“\ninput the deleted id:”);

scanf(“%ld”,&del_id);

while(del_id!=0)

{

head=del(head,del_id);

print(head);

printf(“input the deleted id:”);

scanf(“%ld”,&del_id);

}

printf(“\ninput the record:”);

stu=(struct student *)malloc(LEN);

scanf(“%ld,%f”,&stu->id,&stu->score);

while(stu->id!=0)

{

head=insert(head,stu);

print(head);

printf(“input the inserted record:”);

stu=(struct student *)malloc(LEN);

scanf(“%ld,%f”,&stu->id,&stu->score);

}

}