SDUT 2122单链表中重复元素的删除

//SDUT 2122 应该注意删除重复元素的算法
#include <stdio.h>
#include <stdlib.h>
struct Node
{
int data;
struct Node *next;
};
struct Node *Creat(int n)
{
struct Node head,p;
head=(struct Node)malloc (sizeof (struct Node));
if (head==NULL)
exit (0);
head->next=NULL;
head->data =n;
for (int i=0;i<n;i++)//逆序建立带头结点的表
{
p=(struct Node)malloc (sizeof (struct Node));
if (p= =NULL)
exit(0);
p->next =head->next ;
head->next =p;
scanf ("%d",&p->data );
}
return head;
}
void show (struct Node *x)
{
struct Node *p;
p=x;
printf("%d\n",p->data);
p=x->next;
while (p!=NULL)
{
printf ("%d",p->data );
if (p->next !=NULL)
printf(" “);
else
printf(”\n");
p=p->next ;
}
}
struct Node *Del(struct Node *x)
{
struct Node *head,*p,*q,*r;
head=x;
p=x->next ;
q=x->next ;
while (p!=NULL)
{
r=p->next;
q=p;
while(r!=NULL)
{
if (r->data==p->data )
{
q->next =q->next ->next ;
r=r->next ;
head->data --;
}
else
{
q=q->next ;
r=r->next ;
}
}
p=p->next;
}
return head;

}
int main ()
{
int n;
struct Node * head;
scanf ("%d",&n);
head=Creat(n);
show (head);
head=Del(head);
show (head);
return 0;
}