PAT 1052 Linked List Sorting
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 (<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总结：做了这么多的结构体的题目，好不容易有一道题可以直接写出来的（用stl容器写出来的），结果你给我整这个（题目中给出的结构题不一定是链表中的节点），我真的是无语了
自己写的代码：
#include
#include 大佬的代码：
这里的快速排序将整个结构体都进行了排序，由于题目只需要将结果打印出来即可，没要求说一定要将顺序的结果存储在一个结构体当中，所以结构体当中的 ne 就没起过作用
#include
#include
using namespace std;
struct Node{
int add,e,ne;
bool flag;
}node[100010];
bool cmp(Node a,Node b){
return !a.flag || !b.flag ? a.flag>b.flag:a.e 好好学习，天天向上！
我要考研！