建立一个含头指针的链表，输入年龄和姓名，并删除对应年龄的结点

#include<stdio.h>
#include<malloc.h>
typedef struct StudentType
{
int age;
char name[20];
struct StudentType *next;
}*Linklist,Link;


Linklist Build(int n);
void Delete(Linklist head,int n,int m);
void Print(Linklist head);
int main()
{
int n,age;
Linklist head=NULL;
printf("请输入总人数：\n");
scanf("%d",&n);
head=Build(n);
printf("\n");
Print(head);
printf("\n请输入你要删除的年龄：\n");
scanf("%d",&age);
Delete(head,age,n);
printf("\n\n");
Print(head);
return 0;

}
Linklist Build(int n)
{
Linklist head=NULL,first=NULL,p=NULL;
int i;
head=(Linklist)malloc(sizeof(Link));
head->next=NULL;
first=head;
for(i=0;i<n;i++)
{
p=(Linklist)malloc(sizeof(Link));
scanf("%d%s",&p->age,p->name);
first->next=p;
first=p; 
} 
first->next=NULL;
return head;
}
void Delete(Linklist head,int n,int m)
{
Linklist p=head,q=head->next,ptr;
int flag=0,count=0;
while(q->next!=NULL)
{
if(q->age==n)
{
count++;
ptr=q;
p->next=q->next;
q=q->next;
free(ptr);
flag=1;
}
else
{
q=q->next;
p=p->next; 
}
}
if(q->next==NULL&&q->age==n)
{
flag=1;
p->next=NULL;
count++;
}
if(flag==1)
printf("Delete successfully!\n");
else
printf("not found\n");
if(count==m)
head->next=NULL;
}
void Print(Linklist head)
{
Linklist ptr=head->next;
if(ptr==NULL) printf("无数据\n");
else
{
while(ptr!=NULL)
{
printf("%d\n%s\n",ptr->age,ptr->name);
ptr=ptr->next;
}
}
 }