A1097 Deduplication on a Linked List (25分)【C语言】
题目描述:
Given a singly linked list L with integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each value K, only the first node of which the value or absolute value of its key equals K will be kept. At the mean time, all the removed nodes must be kept in a separate list. For example, given L being 21→-15→-15→-7→15, you must output 21→-15→-7, and the removed list -15→15.
输入格式:
Each input file contains one test case. For each case, the first line contains the address of the first node, and a positive N (≤10 5 ) which is the total number of nodes. The address of a node is a 5-digit nonnegative integer, and NULL is represented by −1.
Then N lines follow, each describes a node in the format:
Address Key Next
where Address is the position of the node, Key is an integer of which absolute value is no more than 10 4 , and Next is the position of the next node.
输出格式:
For each case, output the resulting linked list first, then the removed list. Each node occupies a line, and is printed in the same format as in the input.
输入样例:
00100 5
99999 -7 87654
23854 -15 00000
87654 15 -1
00000 -15 99999
00100 21 23854
输出样例:
00100 21 23854
23854 -15 99999
99999 -7 -1
00000 -15 87654
87654 15 -1
实现代码:
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn = 100010;
const int TABLE = 200010;
bool isExist[TABLE]; //判断该结点的数值是否已经出现过
struct Node{
int address, data, next;
int order; //按order排列,便于之后两个静态链表的输出
}node[maxn];
bool cmp(Node a, Node b){
return a.order<b.order; //按order从小到大排列
}
int main()
{
memset(isExist, false, sizeof(isExist)); //先把isExist数组标记为都未出现过
for(int i=0; i<maxn; ++i){
node[i].order = 2*maxn; //所有结点都初始化为无效结点
}
int n, begin;
scanf("%d%d", &begin, &n);
int address, data, next;
for(int i=0; i<n; ++i){
scanf("%d%d%d", &address, &data, &next);
node[address].address = address;
node[address].data = data;
node[address].next = next;
}
int countValid=0, countRemoved=0; //仍有效的结点数量,被移除的结点数量
int p=begin;
while(p!=-1){
if(!isExist[abs(node[p].data)]){
isExist[abs(node[p].data)] = true; //将该数值标记为出现过
node[p].order = countValid++; //更新order及有效结点数量
}else{ //如果该数值已经出现过,则移除
node[p].order = maxn + countRemoved++;
}
p = node[p].next;
}
sort(node, node+maxn, cmp);
int count = countValid + countRemoved;
for(int i=0; i<count; ++i){
if(i!=countValid-1 && i!=count-1){
printf("%05d %d %05d\n", node[i].address, node[i].data, node[i+1].address);
}else{ //对两个链表的结尾结点单独处理输出
printf("%05d %d -1\n", node[i].address, node[i].data);
}
}
return 0;
}