Node * ListDeleteMore(Node *head,int x)
{
Node *p=head;
Node *pf=NULL;
Node *s=NULL;
while(p!=NULL)
{
if(head->val==x)
{
p=p->next;
head=p;
}
else if(p->val==x)
{
s=p;
p=p->next;
pf->next=s->next;
free(s);
}
else
{
pf=p;
p=p->next;
}
}
return head;
}