1052 Linked List Sorting （25 分）

最新推荐文章于 2022-02-04 17:17:02 发布

chen_zan_yu_

最新推荐文章于 2022-02-04 17:17:02 发布

阅读量167

点赞数 1

分类专栏： PAT

本文链接：https://blog.csdn.net/chen_zan_yu_/article/details/84930638

版权

PAT 专栏收录该内容

224 篇文章 0 订阅

订阅专栏

1052 Linked List Sorting （25 分）

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

1.题目中给出的节点虽然在memory(内存)中,但是不一定在链表上，因此需要根据头结点head进行一次遍历收集链表上的节点，然后进行排序。
2.有可能所有的节点都不在一个链表上，此时链表的size是0，头节点是-1（代表NULL）。

#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
map<int,int> val_ad,ad_val,ad_next;
vector<int> val;
int main()
{
    int n,head;
    cin>>n>>head;
    for(int i=0; i<n; i++)
    {
        int a,b,c;
        cin>>a>>b>>c;
        val_ad[b]=a;
        ad_val[a]=b;
        ad_next[a]=c;
    }
    for(int i=head; i!=-1; i=ad_next[i])
    {
        val.push_back(ad_val[i]);
    }
    sort(val.begin(), val.end());
    cout<<val.size();
    if(val.size()==0)
    {
        printf(" -1");
        return 0;
    }
    printf(" %05d\n",val_ad[val[0]] );
    for(int i=0; i<val.size()-1; i++)
    {
        printf("%05d %d %05d\n",val_ad[val[i]],val[i],val_ad[val[i+1]] );
    }
    printf("%05d %d -1\n", val_ad[val[val.size()-1]],val[val.size()-1]);
    return 0;
}