struct student*delet(struct student*head,int m) //如果链表中的结点所包含的age与m相同便删去该结点
{struct student *p,*p1;
p1=head;
p=head;
while(p1->next) //这个地方,调试时,当p1已经是尾结点时,循环不停止,不理解为什么
{
if(p1->age==m)
{
if(p1==head){
head=head->next;
p=p1=head;}
else{p->next=p1->next;}
p1=p1->next;
}
else{
p=p1;
p1=p1->next;}
}
if(p1->age==m){p->next=NULL;}
return(head);
}
初学者,希望有大神解答
以下是全部代码
#include<stdio.h>
#include<stdlib.h>
#define LEN sizeof(struct student)
struct student
{
long num;
char name[6];
char sex;
int age;
struct student *next;
};
int n;
struct student*creat()
{
struct student*p1,*p2,*head;
n=0;
head=NULL;
p1=p2=(struct student*)malloc(LEN);
printf("input number:");
scanf("%ld",&p1->num);
printf("input name:");
scanf("%s",p1->name);
printf("input sex:");
scanf("%s",&p1->sex);
printf("input age:");
scanf("%d",&p1->age);
while(p1->num!=0){
n++;
if(n==1){head=p1;}
else{p2->next=p1;}
p2=p1;
p1=(struct student*)malloc(LEN);
printf("input number:");
scanf("%ld",&p1->num);
printf("input name:");
scanf("%s",p1->name);
printf("input sex:");
scanf("%s",&p1->sex);
printf("input age:");
scanf("%d",&p1->age);
}
p1->next=NULL;
return(head);
}
void print(struct student*head)
{
struct student*p;
p=head;
if(head!=NULL)
{
do
{
printf("%5ld%8s",p->num,p->name);
printf("%5c%7d\n",p->sex,p->age);
p=p->next;
}while(p!=NULL);
}
}
struct student*delet(struct student*head,int m)
{
struct student *p,*p1;
p1=head;
p=head;
while(p1->next)
{
if(p1->age==m)
{
if(p1==head){
head=head->next;
p=p1=head;}
else{p->next=p1->next;}
p1=p1->next;
}
else{
p=p1;
p1=p1->next;}
}
if(p1->age==m){p->next=NULL;}
return(head);
}
int main()
{
struct student*head,*p;
int m;
head=creat();
printf("input the deleted age:");
scanf("%d",&m);
p=delet(head,m);
print(p);
return 0;
}