【PAT】【Advanced Level】1052. Linked List Sorting (25)-CSDN博客

该博客介绍了一道PAT编程题目——对一个包含N个节点的链表进行升序排序，其中每个节点包含一个整数键值和指向下一个节点的指针。输入包括链表的节点数和头节点地址，以及每个节点的详细信息。解决方案涉及使用映射存储节点，筛选链表元素并进行排序。输出格式需要保持与输入一致，并特别考虑只有一个节点的情况。

1052. Linked List Sorting (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

原题链接：

https://www.patest.cn/contests/pat-a-practise/1052

https://www.nowcoder.com/pat/5/problem/4091

思路：

读入时用map映射

读入后先筛选出链表中的元素

再进行排序

地址使用整数比较快

注意：

只有一个节点的情况

CODE；

#include<iostream>
#include<cstring>
#include<string>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<map>
#include<cstdlib>
#define N 100010
using namespace std;

typedef struct S
{
	int ad;
	int val;
	char* nt;
};

S vc[N];

vector<S> v;
map<int,int> ma;

bool cmp(S a, S b)
{
	return a.val<b.val;
}

int main()
{
	int n;
	scanf("%d",&n);
	char* bg=(char *)malloc(5);
	scanf("%s",bg);
	for (int i=1;i<=n;i++)
	{
		char* a=(char *)malloc(5);
		char* b=(char *)malloc(5);
		int c;
		scanf("%s %d %s",a,&c,b);
		int te=atoi(a);
		ma[te]=i;
		S t;
		//t.nt=(char *)malloc(5);
		t.ad=te;
		t.val=c;
		t.nt=b;
		vc[i]=t;
	}
	//cout<<endl;
	int beg=atoi(bg);
	int pos=ma[beg];
	if (pos == 0)
	{
		printf("0 -1");
	}
	else
	{

	while (beg!=-1)
	{
		//cout<<vc[pos].ad<<" "<<vc[pos].val<<" "<<vc[pos].nt<<endl;
		v.push_back(vc[pos]);
		beg=atoi(vc[pos].nt);
		if (beg==-1) break;
		pos=ma[beg];
	}
	sort(v.begin(),v.end(),cmp);
	//cout<<endl;
	printf("%d %05d\n",v.size(),v[0].ad);
	for (int i=0;i<v.size()-1;i++)
	{
		printf("%05d %d %05d\n",v[i].ad,v[i].val,v[i+1].ad);
	}
	printf("%05d %d %d",v[v.size()-1].ad,v[v.size()-1].val,-1);
	}
	return 0;
}