PAT.A1097 Deduplication on a Linked List

本文介绍了一种删除单链表中重复绝对值节点的算法,并提供了实现步骤和示例输入输出。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<iostream>
#include<string>
#include<set>
#include<map>
#include<utility>
#include<stack>
#include<queue>
using namespace std;
const int maxn = 100010;
struct Node {
	int add, key, next;
	int order;
}node[maxn],node1[maxn],node2[maxn];
bool cmp(Node a, Node b) {
	return a.order < b.order;
}
int main() {
	int begin, n;
	bool hash[maxn] = { false };
	scanf("%d%d", &begin, &n);
	for (int i = 0; i < n; i++)
	{
		int add;
		scanf("%d", &add);
		scanf("%d%d", &node[add].key, &node[add].next);
		node[add].add = add;
	}
	for (int i = 0; i < maxn; i++)
		node[i].order = maxn;
	int p = begin, c = 0;
	while (p != -1) {
		node[p].order = c++;
		p = node[p].next;
	}
	n = c;
	sort(node, node + maxn, cmp);
	int m1 = 0,m2=0;
	for (int i = 0; i < n; i++) {
		int t = abs(node[i].key);
		if (hash[t]==true) {
			node2[m2++] = node[i];
		}
		else {
			node1[m1++] = node[i];
			hash[t] = true;
		}
	}
	for (int i = 0; i < m1; i++) {
		if (i < m1 - 1) printf("%05d %d %05d\n", node1[i].add, node1[i].key, node1[i + 1].add);
		else printf("%05d %d -1\n", node1[i].add, node1[i].key);
	}
	for (int i = 0; i < m2; i++) {
		if (i < m2 - 1) printf("%05d %d %05d\n", node2[i].add, node2[i].key, node2[i + 1].add);
		else printf("%05d %d -1\n", node2[i].add, node2[i].key);
	}
	return 0;
}

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 (<= 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.

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
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值