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(\le 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.

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

题目大意

给出一个链表，对链表按key值升序排列。

思路

按照题目意思，迅速写完代码，提交两个测试点不过，又反复思考测试点，来来回回想了很久，就没发现有过不了的测试点，无奈只好百度，才恍然大悟，这道题着实是有点坑，说说他的坑点在哪里吧：

1. 并不是所有题目给定的节点都一定会在以给定的开始结点为首元结点的链表中，实际上题目只要求输出以给定的开始结点为首元结点的链表，其余节点不做考虑.
2. 这个链表中有可能一个结点也没有，即题目给出的开始节点为-1.

仔细想想，题目是坑了点，但还是自己做题经验不足吧，知道了坑点，题目也就很好解决了.

技巧

这个题并不需要真实的模拟链表排序，只需要把节点信息存储在vector中，直接用sort()排序，再修改next即可.

代码

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

struct Node{
    int address, data, next;
};

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

int main(){
    int data[100000], next[100000], n, head;
    scanf("%d%d", &n, &head);
    for(int i=0, t; i<n; i++){
        scanf("%d", &t);
        scanf("%d", data+t);
        scanf("%d", next+t);
    }
    int p = head;
    vector<Node> ans;
    while(p != -1){
        Node node;
        node.address = p;
        node.data = data[p];
        node.next = -1;
        ans.push_back(node);
        p = next[p];
    }
    if(ans.size() == 0){
        printf("0 -1\n");
        return 0;
    }
    sort(ans.begin(), ans.end(), cmp);
    for(int i=0; i<ans.size()-1; i++)
        ans[i].next = ans[i+1].address;
    printf("%d %05d\n", ans.size(), ans[0].address);
    for(int i=0; i<ans.size(); i++){
        printf("%05d %d ", ans[i].address, ans[i].data);
        if(ans[i].next != -1)
            printf("%05d\n", ans[i].next);
        else
            printf("-1\n");
    }
    return 0;
}