pat-a1052. Linked List Sorting (25)

最新推荐文章于 2022-02-22 15:12:40 发布

原创最新推荐文章于 2022-02-22 15:12:40 发布 · 229 阅读

0 ·

CC 4.0 BY-SA版权

pat 专栏收录该内容

61 篇文章

订阅专栏

本文介绍了一种链表排序算法的实现方法，通过读取链表节点并将其存储为一系列结构，然后按节点中的整数键值进行排序。输入包含节点地址、键值和指向下一个节点的指针，输出则是已排序的链表。

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

最后一个测试点是链表没有结点。。开始没注意

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
map<int,int> an;
map<int,int> na;
map<int,int> no;
int t1[100010];
int main(){
	int a,b,c,x,y,z;
	scanf("%d%d",&a,&b);
	for(int i=0;i<a;++i){
		scanf("%d %d %d",&x,&y,&z);
		an[x]=y;
		na[y]=x;
		no[y]=z;
	}
	int t=0;
	while(b!=-1){
		t1[t++]=an[b];
		b=no[an[b]];
	}
	sort(t1,t1+t);
	if(t) printf("%d %05d\n",t,na[t1[0]]);
	for(int i=0;i<t-1;++i) printf("%05d %d %05d\n",na[t1[i]],t1[i],na[t1[i+1]]);
	if(t) printf("%05d %d -1\n",na[t1[t-1]],t1[t-1]);
	else printf("0 -1\n");
	return 0;
}

A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. Now given a linked list, you are supposed to sort the structures according to their key values in increasing order.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive N (< 10⁵) and an address of the head node, where N is the total number of nodes in memory and the address of a node is a 5-digit positive integer. NULL is represented by -1.

Then N lines follow, each describes a node in the format:

Address Key Next

where Address is the address of the node in memory, Key is an integer in [-10⁵, 10⁵], and Next is the address of the next node. It is guaranteed that all the keys are distinct and there is no cycle in the linked list starting from the head node.

Output Specification:

For each test case, the output format is the same as that of the input, where N is the total number of nodes in the list and all the nodes must be sorted order.

Sample Input:

5 00001
11111 100 -1
00001 0 22222
33333 100000 11111
12345 -1 33333
22222 1000 12345

Sample Output:

5 12345
12345 -1 00001
00001 0 11111
11111 100 22222
22222 1000 33333
33333 100000 -1