1052 Linked List Sorting

最新推荐文章于 2021-12-03 10:36:06 发布

鸡冠花12138

最新推荐文章于 2021-12-03 10:36:06 发布

阅读量106

点赞数

分类专栏： # pat

本文链接：https://blog.csdn.net/yu121380/article/details/89134057

版权

pat 专栏收录该内容

71 篇文章 0 订阅

订阅专栏

1052 Linked List Sorting （25 分)

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 (<105) 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 [−105,105], 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

解析：注意有多余节点，不能直接排序。所以要遍历一遍链表之后再排序。

#include<set>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<cmath>
#include<stack>
#include<cstdio>
#include<string>
#include<bitset>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<bits/stdc++.h>
using namespace std;

#define e exp(1)
#define pp acos(-1)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define mem(a,b) memset(a,b,sizeof(a))
int gcd(int a,int b) {
	return b?gcd(b,a%b):a;
}

const int maxn=1e5+5;
struct node{
	int address,data,next;
}l[maxn];

vector<node> v;

int cmp(node a,node b)
{
	return a.data<b.data;
}
int main()
{
	int n,ad,data,next,address;scanf("%d%d",&n,&ad);
	for(int i=0; i<n; i++)
	{
		scanf("%d%d%d",&address,&data,&next);
		l[address].address=address;
		l[address].data=data;
		l[address].next=next;
	}
	
	while(ad!=-1)
	{
		v.push_back(l[ad]);
		ad=l[ad].next;
	}
	sort(v.begin(),v.end(),cmp);
	
	n=v.size();
	if(n==0)
	{
		printf("0 -1\n");
		return 0;
	}
	printf("%d %05d\n",n,v[0].address);
	for(int i=0; i<n-1; i++)
	{
		printf("%05d %d %05d\n",v[i].address,v[i].data,v[i+1].address);
	}
	printf("%05d %d -1\n",v[n-1].address,v[n-1].data);
	return 0;
}