#include <stdio.h>
#include <stdlib.h>
using namespace std;
typedef struct LinkedList{
int data;
struct LinkedList *next;
}LinkedList,*List;
int a[13]={1,2,3,3,3,3,4,4,5,6,7,8,9};
int n=13;
void build(List &L){
L=(List)malloc(sizeof(LinkedList));
LinkedList *s;
LinkedList *r=L;
for(int i=0;i<n;i++){
s=(List)malloc(sizeof(LinkedList));
s->data=a[i];
r->next=s;
r=r->next;
}
r->next=NULL;
}
void show(List &L){
LinkedList *s=L->next;
while(s){
printf("%d ",s->data);
s=s->next;
}
}
void delCommen(List &L){
LinkedList *s=L->next;
LinkedList *r=s->next;
while(r){
while(s->data==r->data){
r=r->next;//如果元素相等就把r一直向后移 因为是递增的链表
}//知道找到两个不同元素再操作
s->next=r;
s=r;
r=r->next;
}
}
int main(){
List L;
build(L);
show(L);
printf("\n删除公共节点后:\n");
delCommen(L);
show(L);
return 0;
}