PAT(Advanced) 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 (< 10^5^) 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^5^, 10^5^], 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.

解答：

该题我刚开始一直有用例过不了，后来看了其他博主的代码，明白原来N个链表节点不一定都在链表中，吐血。。。 

而且头节点也可能是-1，即链表中没有节点，再次吐血。。。

另外我害怕有N = 0, 而 headAddress > 0，后来自己设计用例，发现还是AC, 虚惊一场。

终于，AC~

AC代码如下：

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

typedef struct{
	int addr, key, nxt; 
}node;

bool cmp(node n1, node n2)
{
	return n1.key < n2.key;
}
int main()
{
	int N, haddr;
	vector<node> nodes(100001);
	vector<node> revec;
	scanf("%d %d", &N, &haddr);
	 
	for(int i = 0; i < N; ++i)
	{
		int addr; node no;
		scanf("%d %d %d", &no.addr, &no.key, &no.nxt);
		nodes[no.addr] = no;
	}
	
	while(N > 0 && haddr != -1)
	{
		revec.push_back(nodes[haddr]);
		haddr = nodes[haddr].nxt;
	}
	sort(revec.begin(), revec.end(), cmp);
	
	if(revec.size()) 
		printf("%d %05d\n", revec.size(), revec[0].addr);
	else
	{
		printf("0 -1\n"); return 0;	
	} 

	int i = 0;
	for(; i < revec.size() - 1; ++i)
	{
		printf("%05d %d %05d\n", revec[i].addr, revec[i].key, revec[i+1].addr);
	}	
	printf("%05d %d -1\n", revec[i].addr, revec[i].key);
	return 0;
}