Description
按照数据输入的相反顺序(逆位序)建立一个单链表,并将单链表中重复的元素删除(值相同的元素只保留最后输入的一个)。
Input
第一行输入元素个数 n (1 <= n <= 15);
第二行输入 n 个整数,保证在 int 范围内。
Output
第一行输出初始链表元素个数;
第二行输出按照逆位序所建立的初始链表;
第三行输出删除重复元素后的单链表元素个数;
第四行输出删除重复元素后的单链表。
Sample
Input
10 21 30 14 55 32 63 11 30 55 30
Output
10 30 55 30 11 63 32 55 14 30 21 7 30 55 11 63 32 14 21
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef struct node
{
int data;
struct node * next;
}node;
node *create(node *&head, int n)
{
node * p;
head = (node *)malloc(sizeof(node));
head -> next = NULL;
for(int i = 0; i < n; i++)
{
p = (node *)malloc(sizeof(node));
scanf("%d", &p -> data);
p -> next = head -> next;
head -> next = p;
}
return head;
}
void *removelist(node *head, int &n)
{
node *p, *q;
p = head -> next;
while(p != NULL && p -> next != NULL)
{
q = p;
while(q != NULL && q -> next != NULL)
{
if(q -> next -> data == p -> data)
{
n--;
q -> next = q -> next -> next;
continue;
}
q = q -> next;
}
p = p -> next;
}
}
void print(node *head)
{
node *p = head -> next;
while(p != NULL)
{
if(p -> next == NULL)printf("%d\n", p -> data);
else printf("%d ", p -> data);
p = p -> next;
}
}
int main()
{
int n;
scanf("%d", &n);
node *l = create(l, n);
printf("%d\n", n);
print(l);
removelist(l, n);
printf("%d\n", n);
print(l);
return 0;
}