点击链接PAT甲级-AC全解汇总

题目：
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
1

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
1
2
3
4
5
6

Sample Output:

5 12345
12345 -1 00001
00001 0 11111
11111 100 22222
22222 1000 33333
33333 100000 -1
1
2
3
4
5
6

题意：
对链表排序

算法笔记的代码：

#include
#include
using namespace std;
const int maxn=100010;
struct NODE{
    int address,data,next;
    bool flag;
}node[maxn];

bool cmp(NODE a,NODE b){
    if(a.flag&&b.flag)
        return a.data<b.data;
    else
        return a.flag>b.flag;
}

int main(){
    for(int i=0;i<maxn;i++){
        node[i].flag=0;
    }
    int n,s1;
    scanf("%d %d",&n,&s1);
    for(int i=0;i<n;i++){
        int address,data,next;
        scanf("%d %d %d",&address,&data,&next);
        node[address].address=address;
        node[address].data=data;
        node[address].next=next;
    }
    int count=0,p=s1;
    while(p!=-1){
        node[p].flag=true;
        p=node[p].next;
        count++;
    }
    if(count==0){
        printf("0 -1\n");
    }else{
        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);
            }
        }
    }
    return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50