# SDUT ACM数据结构上机测试2-2:单链表操作B(基于C语言)

xiaoxiao2021-03-01  18

### 数据结构上机测试2-2:单链表操作B

Time Limit: 1000 ms  Memory Limit: 65536 KiB Submit  Statistic  Discuss

#### Sample Input

10 21 30 14 55 32 63 11 30 55 30

#### Sample Output

10 30 55 30 11 63 32 55 14 30 21 7 30 55 11 63 32 14 21

#### Hint

Source

#include <stdio.h> #include <stdlib.h> struct st { int data; struct st *next; }; int main() { int n,i,t=0; struct st *head,*q,*p,*d; scanf("%d",&n); head=(struct st*)malloc(sizeof(struct st)); head->next=NULL; for(i=0; i<n; i++) { p=(struct st*)malloc(sizeof(struct st)); scanf("%d",&p->data); p->next=head->next; head->next=p; p=p->next; } printf("%d\n",n); p=head->next; printf("%d",p->data); p=p->next; while(p) { printf(" %d",p->data); p=p->next; } printf("\n"); d=head->next; while(d!=NULL) { p=d; q=p->next; while(q!=NULL) { if(d->data==q->data) { t++; p->next=q->next; q=q->next; } else { p=q; q=q->next; } } d=d->next; } printf("%d\n",n-t); p=head->next; printf("%d",p->data); p=p->next; while(p) { printf(" %d",p->data); p=p->next; } printf("\n"); return 0; }