修改链表中的记录

printf("\t\t_________________\n");
printf("\t\t1.输入学生成绩\n");
printf("\t\t2.查询学生成绩\n");
printf("\t\t3.删除学生成绩\n");
printf("\t\t4.修改学生成绩\n");
printf("\t\t5.打印学生成绩\n");
}
if(p->sId==uSid)
{
printf("\n该生已经找到，具体信息如下：\n\n");
printf("姓名：%s\n语文：%.2f\n数学：%.2f\n英语：%.2f\n总分：%.2f\n平均：%.2f\n",p->name,p->sChinese,p->sMath,p->sEnglish,p->sScore,p->sAver);
New_Info=(STU *)malloc(sizeof(STU));
printf("\n学号：");
scanf("%ld",&New_Info->sId);
LIB: printf("姓名：");
scanf("%s",New_Info->name);
printf("语文：");
printf("语文：");
scanf("%f",&p->sChinese);
printf("数学：");
scanf("%f",&p->sMath);
printf("英语：");
scanf("%f",&p->sEnglish);
p->sScore=p->sChinese+p->sMath+p->sEnglish;//总分
case 2:
search_sId(head);break;
case 3:
head=del_stuInfo(head);break;
case 4:
head=modi_stuInfo(head);break;
case 5:
// output(head);break;
{
if(head==p)
{
head=p->next;
}
else
{
printf("记录已删除！\n");
q->next=p->next;
free(p);
}
}
else
{
printf("\t\t6.存盘并退出系统\n");
printf("\t\t__________________\n");
printf("\t\t请选择(1～6)：");
scanf("%d",&x);
switch(x)
{
case 1:
head=insert(head);break;
printf("\n\n否则存储后：\n(1)p->sid=%ld,p->name=%s\n",p->sId,p->name);
printf("(2)New_Info->sid=%ld,New_Info->name=%s\n",New_Info->sId,New_Info->name);
}
}
else
{
p->next=New_Info;
New_Info->next=NULL;
}
}
return(head);
}
void search_sId(STU *head)//根据学号查询
{
STU *p;
long uSid;
printf("\n请输入要查询的学号：");
}
else
{
while(Biblioteka feof(fp)); if(fread(&per,sizeof(struct student),1,fp)==1)
{
p=(STU *)malloc(sizeof(STU));
p->sId=per.sId;
p->sChinese=per.score[0];
};
FILE *fp;
STU *load(char fileName[])//将文件中的数据放入链表
{
STU *p,*q,*head;
struct student per;
q=head=NULL;
if((fp=fopen(fileName,"rb"))==NULL)
{
return (head);
{
p=p->next;
}
if(p->sId==uSid)
{
printf("\n学号：");
scanf("%ld",&p->sId);
printf("姓名：");
scanf("%s",p->name);
p->sAver=0;
else
{
q->next=p;
q=p;
}
fclose(fp);
return (head);
}
}
}
STU *insert(STU *head)//插入记录，并算出平均分。
{
STU *New_Info,*p,*q;
New_Info->sAver=0;
p->sAver=p->sScore/3;//平均分
printf("总分：%.2f\n",p->sScore);
printf("平均分:%.2f",p->sAver);
}
else
{
printf("\n查无此人！\n");
}
}
return (head);
p=head;
if(head==NULL)//如果链表为空
{
printf("无任何学生信息！\n");
return (head);
}
else
{
while((p->next!=NULL)&&(p->sId!=uSid))//如果找到数据，则循环退出。此时，指针会自动定位到正确数据上。
New_Info->sAver=New_Info->sScore/3;//平均分
printf("总分：%.2f\n",New_Info->sScore);
printf("平均分:%.2f",New_Info->sAver);
p=head;
if(head==NULL)
{
head=New_Info;
float aver;
};
struct node
{
long sId;
char name[20];
float sChinese;
float sMath;
float sEnglish;
float sScore;
float sAver;
struct node *next;
New_Info->next=NULL;
}
else
{
while((p->next!=NULL)&&(p->sId<New_Info->sId))
{
q=p;
p=p->next;
}
if(p->sId>=New_Info->sId)
{
if(head==p)
scanf("%f",&New_Info->sChinese);
printf("数学：");
scanf("%f",&New_Info->sMath);
printf("英语：");
scanf("%f",&New_Info->sEnglish);
New_Info->sScore=New_Info->sChinese+New_Info->sMath+New_Info->sEnglish;//总分
}
void main()
{
int x;//菜单
STU *head;
char fname[20];
printf("请输入学生数据库文件名：");
scanf("%s",fname);
head=load(fname);
while(1)
{
printf("\n\n\t\t主菜单\n");
case 6:
// save(head,fname);