PTA甲级A1052&静态链表

静态链表

例题：PTA甲级A1052 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 (<10e​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 [−10e5,10e5
​​ ], 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<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 100005;
//步骤一：定义静态链表
struct Node{
    int address, data, next;
    bool flag; //结点是否在链表上
}node[maxn];
//筛选有效结点，并按data升序排序
bool cmp(Node a, Node b){
    if(a.flag == false || b.flag == false)
        return a.flag > b.flag;//有效结点为1，无效为0，无效的放后面
    return a.data < b.data;
}
int main(){
    //步骤2 初始化
    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{
        sort(node, node+maxn, cmp);//排序规则取决于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);//node[i+1].next还是原来的，next并没有变，不对 
            else
                printf("%05d %d -1\n",node[i].address,node[i].data);
        }
    }
    return 0;
}