1052. Linked List Sorting (25)-优快云博客

本文介绍了一种链表排序的方法，通过读取链表节点并按其键值进行排序，最终输出排序后的链表结构。文章包含完整的C++代码实现，并提供了一个样例输入输出以验证算法的有效性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1052. Linked List Sorting (25)
时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B
判题程序 Standard 作者 CHEN, Yue

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

#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>

using namespace std;
const int MaxN = 100010;

struct Slinklist
{
    int Addr;
    int data;
    int nextAddr;
}SLT[MaxN] = { -1 }, Valid[MaxN];

bool cmp(Slinklist a, Slinklist b)
{
    return a.data < b.data;
}

int main()
{
#ifdef _DEBUG
    freopen("data.txt", "r+", stdin);
#endif

    int startAddr, N, Addr, count = 0;
    scanf("%d %d", &N, &startAddr);

    if (N == 0 || startAddr == -1)
    {
        printf("0 -1\n");
        return 0;
    }

    while (N--)
    {
        scanf("%d", &Addr);
        scanf("%d %d", &SLT[Addr].data, &SLT[Addr].nextAddr);
        SLT[Addr].Addr = Addr;
    }

    Addr = startAddr;

    while (Addr != -1)
    {
        Valid[count++] = SLT[Addr];
        Addr = SLT[Addr].nextAddr;
    }

    sort(Valid, Valid + count, cmp);

    printf("%d %05d\n", count, Valid[0].Addr);
    for (int i = 0; i < count; ++i)
    {
        printf("%05d %d ", Valid[i].Addr, Valid[i].data);
        if (i != count - 1)
            printf("%05d\n", Valid[i + 1].Addr);
        else
            printf("-1");
    }

    return 0;
}