第1个回答 2009-03-19
给你个单向顺序链表的程序代码看吧,包括链表的基本操作了,调试通过,你自己研究研究,你的代码看着有点迷糊
#include<stdio.h>
#define NULL 0
#include<malloc.h>
#define LEN sizeof(struct student)
struct student
{
long num;
float score;
struct student *next;
}
int n;
//建立一个简单动态单向链表函数
struct student *creat(void)
{
struct student *p1,*p2,*head;
n=0;
p1=p2=(struct student *)malloc(LEN);
scanf("%ld,%f",&p1->num,&p1->score);
head=NULL;
while(p1->num!=0)
{
n++;
if(n==1)head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf("%ld,%f",&p1->num,&p1->score);
}
p2->next=NULL;
return(head);
}
//链表输出函数
void print(struct student *head)
{
struct student *p;
printf("\nNow,these %d records are:\n",n);
p=head;
if(head!=NULL)
do
{
printf("%ld\t%5.1f\n",p->num,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->num&&p1->next!=NULL)
{p2=p1;p1=p1->next;}
if(num==p1->num)
{
if(p1==head)
head=p1->next;
else
p2->next=p1->next;
printf("delete:%ld\n",num);
n=n-1;
}
else
printf("%ld can not been found!\n",num);
end:;//这里一定要有个冒号
return(head);
}
//插入结点函数
struct student *insert(struct student *head,struct student *stud)
{
struct student *p0,*p1,*p2;
p0=stud;
p1=head;
if(head==NULL)
{head=p0;p0->next=NULL;}
while((p0->num>p1->num)&&(p1->next!=NULL))
{p2=p1;p1=p1->next;}
if(p0->num<=p1->num)
{
if(head==p1)
head=p0;
else
p2->next=p0;
p0->next=p1;
}
else
{
p1->next=p0;p0->next=NULL;
}
n=n+1;
return(head);
}
//主函数调用
void main()
{
struct student *head,stu;
long del_num;
printf("input records:\n");
head=creat();
print(head);
printf("\ninput the the deleted number:\n");
scanf("%ld",&del_num);
while(del_num!=0)
{
head=del(head,del_num);
print(head);
printf("\ninput the the deleted number:\n");
scanf("%ld",&del_num);
}
printf("\ninput the inserted record:\n");
stu=(struct student *)malloc(LEN);
scanf("%ld,%f",&stu.num,&stu.score);
while(stu->num!=0)
{
head=insert(head,&stu);
print(head);
printf("\ninput the inserted record:\n");
stu=(struct student *)malloc(LEN);
scanf("%ld,%f",&stu.num,&stu.score);
}
}