代码:
#include<stdio.h>
#include<malloc.h>struct node
{
int data;
struct node *next;
};
struct node *creat(int n)
{
struct node *head,*p;
head=(struct node*)malloc(sizeof(struct node));
head->next=NULL;
for(int i=0;i<n;i++)
{
p=(struct node*)malloc(sizeof(struct node));
scanf("%d",&p->data);
p->next=NULL;
p->next=head->next;
head->next=p;
}
return head;
}
void print(struct node *h)
{
struct node *p=h->next;
while(p!=NULL)
{
if(p->next==NULL)
printf("%d\n",p->data);
else
printf("%d ",p->data);
p=p->next;
}
}
struct node *chazhao(struct node *head,int n)
{
struct node *p,*q,*h;
h=head->next;
while(h!=NULL)
{
p=h;
while(p->next!=NULL)
{
if(p->next->data==h->data)
{
q=p->next;
p->next=q->next;
free(q);
n--;
}
else
p=p->next;
}
h=h->next;
}
printf("%d\n",n);
return head;
}
int main()
{
int n;
scanf("%d",&n);
struct node *head1,*head2;
head1=creat(n);
printf("%d\n",n);
print(head1);
head2=chazhao(head1,n);
print(head2);
return 0;
}