浙大 PAT 甲级 1097 Deduplication on a Linked List 删除链表中重复元素

这题和前面很多题重复了，就不再多说了。STL用的好，可以减少很多思维复杂度，虽然代码可能不是很简洁，在机试时节约时间才是最重要的。

这题唯一需要注意的时删除的元素可能为0个。另外，判断是使用绝对值判断，输出是输出的时原值。

#include<stdio.h>
#include<vector>
#include<map>
#include<set>
#include<math.h>
using namespace std;

struct Node
{
	int address;
	int key;
	int next;
};
map<int, int> address2index;
set<int> deduplicatedKey;
vector<Node> allNode;
vector<Node> originalLink;
vector<Node> resultLink;
vector<Node> removeLink;

int main()
{
	int head, N;
	scanf("%d %d", &head, &N);
	// address2index allNode
	for (int i = 0; i < N; i++)
	{
		Node node;
		scanf("%d %d %d", &node.address, &node.key, &node.next);
		address2index[node.address] = i;
		allNode.push_back(node);
	}
	// originalLink
	while (head != -1)
	{
		originalLink.push_back(allNode[address2index[head]]);
		head = allNode[address2index[head]].next;
	}
	// resultLink removeLink
	for (int i = 0; i < originalLink.size(); i++)
	{
		int key = abs(originalLink[i].key);
		if (deduplicatedKey.count(key) == 0)
		{
			resultLink.push_back(originalLink[i]);
			deduplicatedKey.insert(key);
		}
		else
		{
			removeLink.push_back(originalLink[i]);
		}
	}
	// construct link
	for (int i = 0; i < resultLink.size()-1; i++)
	{
		resultLink[i].next = resultLink[i + 1].address;
	}
	resultLink.back().next = -1;
	if (removeLink.empty() == false)
	{
		for (int i = 0; i < removeLink.size() - 1; i++)
		{
			removeLink[i].next = removeLink[i + 1].address;
		}
		removeLink.back().next = -1;
	}
	// print
	for (int i = 0; i < resultLink.size() - 1; i++)
	{
		printf("%05d %d %05d\n", resultLink[i].address, resultLink[i].key, resultLink[i].next);
	}
	printf("%05d %d -1\n", resultLink.back().address, resultLink.back().key);
	if (removeLink.empty() == false)
	{
		for (int i = 0; i < removeLink.size() - 1; i++)
		{
			printf("%05d %d %05d\n", removeLink[i].address, removeLink[i].key, removeLink[i].next);
		}
		printf("%05d %d -1\n", removeLink.back().address, removeLink.back().key);
	}
	return 0;
}