原创 PAT甲级——（1052） Linked List Sorting

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.
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

题意：给出N个结点的地址address、数据域data以及指针域next，然后给出链表的首地址，要求把这个链表上的结点按data值从小到大输出。

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 100005;
struct Node {
	int address, data, next;
	bool flag;
}node[maxn];

bool cmp(Node a, Node b) {
	if (a.flag == false || b.flag == false) {
		return a.flag > b.flag;

	}
	else {
		return a.data < b.data;
	}
}
int main() {
	for (int i = 0; i < maxn; i++) {
		node[i].flag = false;
	}
	int n, begin, address;
	scanf("%d%d", &n, &begin);
	for (int i = 0; i < n; i++) {
		scanf("%d", &address);
		scanf("%d%d", &node[address].data, &node[address].next);
		node[address].address = address;
	}
	int count = 0, p = begin;
	//枚举链表，对flag进行标记，同时计数有效结点个数
	while (p != -1) {
		node[p].flag = true;
		count++;
		p = node[p].next;
	}
	if (count == 0) {
		printf("0 -1");
	}
	else {//筛选有效结点，并按data从小到大排序
		sort(node, node + maxn, cmp);
		printf("%d %05d\n", count, node[0].address);
		for (int i = 0; i < count; i++) {
			if (i != count - 1) {
				printf("%05d %d %05d\n", node[i].address, node[i].data, node[i + 1].address);
			}
			else {
				printf("%05d %d -1\n", node[i].address, node[i].data);
			}
		}

	}
}

思路：
1.定义静态链表，其中结点性质由bool型变量flag定义，表示为结点在链表中是否出现。flag为false表示无效结点（不在链表上的结点）。
2.初始化，令flag均为false,表示初始状态下所有结点都是无效结点。
3.由题目给出的链表首地址begin遍历整条链表，并标记有效结点的flag为true，同时计数有效结点的个数count。
4.对结点进行排序，排序函数cmp的排序原则为：如果cmp的两个参数结点中有无效结点的话，则按flag从大到小排序，以把有效结点排到数组左端（因为有效结点的flag为1，大于无效结点的flag),否则按数据域从小到大排序。
5.由于有效结点已经按照数据域从小到大排序，因此按要求输出有效结点即可。