#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef int element;
struct node
{
element data;
node *next;
};
element n;
struct node *Creat(int n)
{
struct node *head,*p;
head = new node;
head->next = NULL;
for(int i=0;i<n;i++)
{
p = new node;
scanf("%d",&p->data);
p->next = NULL;
p->next = head->next;
head->next = p;
}
return head;
};
int del(struct node *head,int n)
{
struct node *x,*q,*z;//元素的删除需要借助的帮助;
q = head->next;
while(q)
{
z = q;
x = q->next;
while(x)
{
if(q->data==x->data)
{
z->next = x->next;
x = z->next;
n--;;
}
else
{
z = z->next;
x = x->next;
}
}
q = q->next;
}
return n;
};
void display(struct node *head)
{
struct node *p;
p = head->next;
while(p)
{
if(p->next) printf("%d ",p->data);
else printf("%d\n",p->data);
p = p->next;
}
}
int main()
{
int m;
struct node *head;
while(~scanf("%d",&n))
{
head = Creat(n);
printf("%d\n",n);
display(head);
m = del(head,n);
printf("%d\n",m);
display(head);
}
return 0;
}
数据结构实验之链表七:单链表中重复元素的删除
最新推荐文章于 2019-10-12 10:37:50 发布