题目描述
根据一个递增的整数序列构造有序单链表,删除其中的重复元素
输入
输入包括多组测试数据,每组测试数据占一行,第一个为大于等于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<stdio.h>
struct node
{
int data;
node *next;
};
void del(node *head)
{
node *now = head->next;
while(now!=NULL)
{
if(now->next!=NULL&&now->data==now->next->data)
{
node *p = now->next;//此处注意输入为 3 1 1 1的情况
while(p!=NULL&&p->data==now->data)
{
p = p->next;
}
now->next = p;
}
else
now = now->next;
}
head = head->next;
while(head!=NULL)
{
printf("%d", head->data);
if(head->next!=NULL)
printf(" ");
else
printf("\n");
head = head->next;
}
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
if(n==0)
{
printf("list is empty\n");
break;
}
int m;
node *head, *now, *p;
head = new node;
head->next = NULL;
now = head;
for(int i=0; i<n; i++)
{
scanf("%d",&m);
p = new node;
p->data = m;
p->next = NULL;
now->next = p;
now = p;
printf("%d",m);
if(i<n-1)
printf(" ");
else
printf("\n");
}
del(head);
}
}