建立一个学生链表,每个结点包括学号、姓名、性别、年龄。输入一个年龄值,如果链
表中的结点所包含的年龄等于此年龄,则将此结点删去,否则,显示没有该年龄的学生。
建立一个学生链表,每个结点包括学号、姓名、性别、年龄。输入一个年
答案:2 悬赏:70
解决时间 2021-04-09 18:41
- 提问者网友:房东的猫
- 2021-04-09 02:49
最佳答案
- 二级知识专家网友:深街酒徒
- 2021-04-09 04:11
#include
#include
#define LEN sizeo(struct student)
struct student
{
char num[6];
char name[8];
char sex[2];
int age;
struct student *next;
}stu[10];
void main()
{
struct student *p,*pt,*head;
int i,length,iage,flag=1;
int find=0;
while(flag==1)
{
printf("input length of list(<10):");
scanf("%d",&length);
if(length<10)
flag=0;
}
for (i=0;i
{
p=(struct student * ) malloc(LEN);
if(i==0)
head=pt=p;
else
pt->next=p;
pt=p;
printf("No.:");
scanf("%s",p->num);
printf("name:");
scanf("%s",p->name);
printf("sex:");
scanf("%s",p->sex);
printf("age:");
scanf("%d",&p->age);
}
p->next=NULL;
p=head;
printf("\n No. name sex age\n");
while(p!=NULL)
{
printf("%4s%8s%6s%6d\n",p->num,p->name,p->sex,p->age);
p=p->next;
}
printf("input age:");
scanf("%d",&iage);
pt=head;
p=pt;
if(pt->age==iage)
{
p=pt->next;
head=pt=p;
find=1;
}
else
pt=pt->next;
while(pt!=NULL)
{
if(pt->age==iage)
{
p->next=pt->next;
find=1;
}
else
p=pt;
pt=pt->next;
}
if(!find)
printf("not found %d.",iage);
p=head;
printf("\n No. name sex age\n");
while(p!=NULL)
{
printf("%4s%8s",p->num,p->name);
printf("%6s%6d\n",p->sex,p->age);
p=p->next;
}
}
#include
#define LEN sizeo(struct student)
struct student
{
char num[6];
char name[8];
char sex[2];
int age;
struct student *next;
}stu[10];
void main()
{
struct student *p,*pt,*head;
int i,length,iage,flag=1;
int find=0;
while(flag==1)
{
printf("input length of list(<10):");
scanf("%d",&length);
if(length<10)
flag=0;
}
for (i=0;i
p=(struct student * ) malloc(LEN);
if(i==0)
head=pt=p;
else
pt->next=p;
pt=p;
printf("No.:");
scanf("%s",p->num);
printf("name:");
scanf("%s",p->name);
printf("sex:");
scanf("%s",p->sex);
printf("age:");
scanf("%d",&p->age);
}
p->next=NULL;
p=head;
printf("\n No. name sex age\n");
while(p!=NULL)
{
printf("%4s%8s%6s%6d\n",p->num,p->name,p->sex,p->age);
p=p->next;
}
printf("input age:");
scanf("%d",&iage);
pt=head;
p=pt;
if(pt->age==iage)
{
p=pt->next;
head=pt=p;
find=1;
}
else
pt=pt->next;
while(pt!=NULL)
{
if(pt->age==iage)
{
p->next=pt->next;
find=1;
}
else
p=pt;
pt=pt->next;
}
if(!find)
printf("not found %d.",iage);
p=head;
printf("\n No. name sex age\n");
while(p!=NULL)
{
printf("%4s%8s",p->num,p->name);
printf("%6s%6d\n",p->sex,p->age);
p=p->next;
}
}
全部回答
- 1楼网友:一场云烟
- 2021-04-09 05:15
name sex age\ if(i==0) head=pt=p;;length:":" if(pt-> } printf(" printf("age==iage) { p=pt->;);sex;);10):");); printf(" }stu[10]; printf("%d".h> } if(; } else pt=pt->,*pt; if(length<num); p=pt;age==iage) { p->next=pt-> #define len sizeo(struct student) struct student { char num[6],p->n no,flag=1; int i;i++) { p=(struct student * ) malloc(len);next;sex;%s",p->n";input age;age;),p->\ find=1!=null) { printf(",p->n" char name[8]; p=head;age); pt=p;;%6s%6d\ } else p=pt;next; printf("next;i< while(p;input length of list(<,iage;next; char sex[2];,p->num; #include<. name sex age\.h>,&iage);%s" else pt-> scanf("%d":" printf("name,p-> pt=pt->%s" scanf(" void main() { struct student *p;10) flag=0:" scanf(" } for (i=0;name;n no,*head;not found %d;no;%d"%4s%8s%6s%6d\,p-> scanf("!=null) { printf("#include<name);." while(p; p=head;next=null; head=pt=p; struct student *next;age).;age);\ find=1; while(flag==1) { printf("sex);););n",p-> printf(" scanf(",p->sex; scanf(",&p-> int age;; pt=head; p=p->next=p;num;name),p->!find) printf(" } p->stdio!=null) { if(pt->next; p=p->:",&length),length;n"%4s%8s",p-> int find=0,iage););next; printf(" while(pt;;malloc
我要举报
如以上问答内容为低俗、色情、不良、暴力、侵权、涉及违法等信息,可以点下面链接进行举报!
大家都在看
推荐资讯