1097 Deduplication on a Linked List

最新推荐文章于 2022-06-20 10:38:58 发布

伍振仁のblog

最新推荐文章于 2022-06-20 10:38:58 发布

阅读量108

点赞数

分类专栏：甲级 pat 链表

本文链接：https://blog.csdn.net/a553650885/article/details/86750375

版权

pat 同时被 3 个专栏收录

39 篇文章 0 订阅

订阅专栏

甲级

25 篇文章 0 订阅

订阅专栏

链表

4 篇文章 0 订阅

订阅专栏

这道题关键的一点就是在结构体里弄一个order,定义一个hashabs(data) 如果出现过,order就放在后面
maxn + count++;
然后顺序输出即可

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 100005;
struct Node {
	int address, data, next;
	int order;
	Node() {
		order = 2 * maxn;
	}
}node[maxn];
bool cmp(Node a, Node b) {
	return a.order < b.order;
}
bool exist[maxn] = { 0 };
int main() {
	int firstAdd, n, add;
	scanf("%d%d", &firstAdd, &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &add);
		scanf("%d%d", &node[add].data, &node[add].next);
		node[add].address = add;
	}
	int p = firstAdd, countvalid = 0, countmove = 0;
	while (p != -1) {
		if (exist[abs(node[p].data)] == 0) {
			exist[abs(node[p].data)] = 1;
			node[p].order = countvalid++;
		}
		else {
			node[p].order = maxn + countmove++;
		}
		p = node[p].next;
	}
	int count = countvalid + countmove;
	sort(node, node + maxn, cmp);
	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;
}