首页 诗词 字典 板报 句子 名言 友答 励志 学校 网站地图
当前位置: 首页 > 教程频道 > 开发语言 > C语言 >

一个简单链表运行出错,求解,该如何处理

2012-03-28 
一个简单链表运行出错,求解[codeC/C++][/code]我的运行环境是:VS2010#includestdio.h#includemalloc.h

一个简单链表运行出错,求解
[code=C/C++][/code]
我的运行环境是:VS2010
#include<stdio.h>
#include<malloc.h>
#define LEN sizeof(struct student)
struct student
{
long num;
float score;
struct student*next;
};int n;
int main()//主函数
{
struct student student*creat();
struct student student*del(student*,long);
struct student student*insert(student*,student*);
void print(student*);
struct student*head,*stu;
long del_num;
printf("input records:\n");
head=creat();
print(head);
printf("\ninput the deleted number:");
scanf("%ld",&del_num);
while(del_num!=0)
{
head=del(head,del_num);
print(head);
printf("\ninput the deleted number:");
scanf("%ld",&del_num);
}
printf("\ninput the insert record:");
stu=(struct student*)malloc(LEN);
scanf("%ld,%f",&stu->num,&stu->score);
while (stu->num!=0)
{
head=insert(head,stu);
print(head);
printf("input the inserted record:");
stu=(struct student*)malloc(LEN);
scanf("%ld,%f",&stu->num,&stu->score);
}
return 0;
}
struct student*creat()//创建链表
{
struct student*head;
struct student*p1,*p2;
n=0;
p1=p2=(struct student*)malloc(LEN);
scanf("%ld,%f",&p1->num,&p1->score);
head=NULL;
while (p1->num!=0)
{
n=n+1;
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);
}
struct student*del(struct student*head,long num)//删除节点
{
struct student*p1,*p2;
if (head==NULL)
{
printf("\nlist null!\n");
return(head);
}
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("deleted:%ld\n",num);
n=n-1;
}
else printf ("%ld 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->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 print (struct student*head)
{
struct student*p;
printf("\n Now these %d records are :\n",n);
p=head;
if (head!=NULL)
do 
{
printf ("%ld%5.1f\n",p->num,p->score);
p=p->next;
}while(p!=NULL);
}


[解决办法]
哪儿错?

热点排行