PAT 甲级 1097 Deduplication on a Linked List

最新推荐文章于 2024-06-11 02:30:00 发布

漫浸天空的雨色

最新推荐文章于 2024-06-11 02:30:00 发布

阅读量453

点赞数 1

CC 4.0 BY-SA版权

分类专栏： PAT甲级 PAT甲级/乙级机试经验文章标签： PAT甲级 Deduplication on a Linked List 1097

本文链接：https://blog.csdn.net/a845717607/article/details/87302057

PAT甲级/乙级机试经验同时被 2 个专栏收录

254 篇文章

订阅专栏

PAT甲级

159 篇文章

订阅专栏

本文介绍了一种链表处理算法，旨在去除链表中绝对值重复的节点，并保持原有顺序。通过静态链表实现，利用标号技巧区分不同类型节点，最终输出处理后的链表及被移除的节点列表。

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

1097 Deduplication on a Linked List （25 point(s)）

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

经验总结：

emmmm 静态链表排序常规题，这一题是将冗余的结点按照原来在链表中的顺序单独成链，只要善用标号的技巧，对于不同类型的结点进行不同的标号，然后根据标号排序，最后输出就行啦~

AC代码

#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn=100010;
const int INF=0x3fffffff;
bool flag[10010]={false};
struct node
{
	int address,next,key,level;
	node()
	{
		level=INF;
	}
}Node[maxn];
bool cmp(node a,node b)
{
	return a.level<b.level;
}
int main()
{
	int start,n,id;
	scanf("%d%d",&start,&n);
	for(int i=0;i<n;++i)
	{
		scanf("%d",&id);
		Node[id].address=id;
		scanf("%d%d",&Node[id].key,&Node[id].next);
	}
	int p=start,num=0,total=0;
	while(p!=-1)
	{
		if(flag[abs(Node[p].key)]==false)
		{
			Node[p].level=num++;
			flag[abs(Node[p].key)]=true;
		}
		else
			Node[p].level=n+total;
		p=Node[p].next;
		++total;
	}
	sort(Node,Node+maxn,cmp);
	for(int i=0;i<num;++i)
	{
		printf("%05d %d ",Node[i].address,Node[i].key);
		if(i<num-1)
			printf("%05d\n",Node[i+1].address);
		else
			printf("-1\n");
	}
	for(int i=num;i<total;++i)
	{
		printf("%05d %d ",Node[i].address,Node[i].key);
		if(i<total-1)
			printf("%05d\n",Node[i+1].address);
		else
			printf("-1\n");
	}
	return 0;
}