【PAT】A-1052 Linked List Sorting【链表】

最新推荐文章于 2024-11-18 15:29:44 发布

昵称五个字

最新推荐文章于 2024-11-18 15:29:44 发布

阅读量604

点赞数 1

CC 4.0 BY-SA版权

分类专栏： PAT

本文链接：https://blog.youkuaiyun.com/a617976080/article/details/97304704

该博客介绍了如何对一个包含整数键值的链表进行升序排序。输入包含链表的节点数量和头节点地址，每个节点包含地址、键值和指向下一个节点的指针。博主提出了将链表节点地址存储在数组中，然后按值排序，从而得到排序后的链表的解决方案。

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

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.