Question

问题：检查一个单向链表，删除其中数据大于100的元素。下面程序错在哪儿？

#include<stdio.h>
#include<stdlib.h>
typedef struct EAM
{
double x;
struct EAM *next;
}EMP;
struct typelist
{
EMP *head,*rear;
long len;
}EMPlist;
long creat(EMP *head);
void output(EMP *p);
long delet(EMP *p,int n)
{
EMP *q;
p=q;
p=p->next;
while(p!=NULL)
{
if(p->x>n)
{
q->next=p->next;
EMPlist.len--;
p=q->next;
continue;
}
q=p;
p=p->next;
}
return EMPlist.len;
}
void main()
{
long n;
EMPlist.head=(EMP*)malloc(sizeof(EMP));
EMPlist.head->next=NULL;
EMPlist.rear=NULL;
EMPlist.len=0;
printf("input numbers:\n");
n=creat(EMPlist.head);
printf("\n the result:\n");
output(EMPlist.head);
n=delet(EMPlist.head,100);
printf("\n the result after delet:\n");
output(EMPlist.head);
}

Answer 1

long delet(EMP *p,int n)
{
EMP *q;
p=q;
p=p->next;
……
这个函数第二句应该是 q=p 吧