题目链接:http://codeup.cn/problem.php?cid=100000607&pid=5
题目描述
根据一个递增的整数序列构造有序单链表,删除其中的重复元素
输入
输入包括多组测试数据,每组测试数据占一行,第一个为大于等于0的整数n,表示该单链表的长度,后面跟着n个整数,表示链表的每一个元素。整数之间用空格隔开
输出
针对每组测试数据,输出包括两行,分别是删除前和删除后的链表元素,用空格隔开
如果链表为空,则只输出一行,list is empty
样例输入
5 1 2 3 4 5
5 1 1 2 2 3
0
样例输出
1 2 3 4 5
1 2 3 4 5
1 1 2 2 3
1 2 3
list is empty
代码
#include <cstdio>
#include <cstdlib>
struct node {
int data;
node* next;
};
int main() {
int n, data;
node* head, *r, *q, *p;
while(scanf("%d",&n) != EOF) {
if(n == 0)
printf("list is empty\n");
else {
head = new node;
head->next = NULL;
r = head;
for(int i = 0; i < n; i++) {
scanf("%d",&data);
q = new node;
q->data = data;
r->next = q;
r = q;
}
r->next = NULL;
p = head->next;
while(p != NULL) {
printf("%d ",p->data);
p = p->next;
}
printf("\n");
q = head;
p = q->next;
while(p!= NULL) {
if(p->data == q->data) {
q->next = p->next;
delete(p);
p = q->next;
}
else {
q = p;
p = q->next;
}
}
p = head->next;
while(p != NULL) {
printf("%d ",p->data);
p = p->next;
}
printf("\n");
}
}
return 0;
}