1097 Deduplication on a Linked List (25分)
作者:CHEN, Yue
单位:浙江大学
代码长度限制:16 KB
时间限制:400 ms
内存限制:64 MB
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.
Input Specification:
Each input file contains one test case. For each case, the first line contains the address of the first node, and a positive N (≤105 ) 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 104 , and Next is the position of the next node.
Output Specification:
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.
Sample Input:
00100 5
99999 -7 87654
23854 -15 00000
87654 15 -1
00000 -15 99999
00100 21 23854
Sample Output:
00100 21 23854
23854 -15 99999
99999 -7 -1
00000 -15 87654
87654 15 -1
题意:
给一条链表,要求保留链表中绝对值不同的结点,并输出删除的结点也用链表输出。
思路:
静态链表解决,用两个容器来分别存放保留结点和删除的结点,创建哈希表来记录是否该绝对值已出现,是则进入删除容器,否则进入保留容器,直到结尾。(这样操作也避免了所给结点并不属于原始链表的情况)。
参考代码:
#include <iostream>
#include <vector>
using namespace std;
struct Node {
int address, value, next;
} node[100010];
bool hashtable[10001];
vector<Node> v[2];
int main() {
int st, n, address;
scanf("%d%d", &st, &n);
for (int i = 0; i < n; i++) {
scanf("%d", &address);
scanf("%d%d", &node[address].value, &node[address].next);
node[address].address = address;
}
while (st != -1) {
int temp = abs(node[st].value);
if (!hashtable[temp]) {
hashtable[temp] = true;
v[0].push_back(node[st]);
} else v[1].push_back(node[st]);
st = node[st].next;
}
for (int k = 0; k < 2; k++) {
for (int i = 0; i < v[k].size(); i++) {
if (i < v[k].size() - 1)
printf("%05d %d %05d\n", v[k][i].address, v[k][i].value, v[k][i + 1].address);
else printf("%05d %d -1\n", v[k][i].address, v[k][i].value);
}
}
return 0;
}
如有错误,欢迎指正