#include<stdio.h>
#include<malloc.h>
typedef struct LinkNode{
int data;
struct LinkNode *next;
}LinkNode;
LinkNode *create_LNode(LinkNode *L){
LinkNode *newp,*tail;
int a;
L=NULL;//创建一个不带头结点的链表
printf("请输入节点:\n");
scanf("%d",&a);
while(a!=-1){
newp=(LinkNode*)malloc(sizeof(LinkNode));
newp->next=NULL;
newp->data=a;
if(L==NULL){
L=tail=newp;
}
else{
tail->next=newp;tail=newp;
}
scanf("%d",&a);
}
return L;
}
LinkNode *delete_Purge(LinkNode *L){
LinkNode *A,*B,*C;
for(A=L;A;A=A->next){
for(B=A,C=B->next;C;){
if(C->data==A->data){
B->next=C->next;
free(C);
C=B->next;
}
else{
B=C;
C=C->next;
}
}
}
printf("去除重复元素成功\n\n");
return L;
}
void print(LinkNode *L){
LinkNode *p;
printf("去除之后链表的元素为:\n");
for(p=L;p;p=p->next){
printf("%d ",p->data);
}
printf("\n");
}
int main(){
LinkNode *L;
L=create_LNode(L);
print(L);
L=delete_Purge(L);
print(L);
return 0;
}
转载于:https://www.cnblogs.com/jiafeng1996/p/11273697.html