1074 Reversing Linked List （25 分）

Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given Lbeing 1→2→3→4→5→6, if K=3, then you must output 3→2→1→6→5→4; if K=4, you must output 4→3→2→1→5→6.

Input Specification:

Each input file contains one test case. For each case, the first line contains the address of the first node, a positive N (≤10​5​​) which is the total number of nodes, and a positive K (≤N) which is the length of the sublist to be reversed. The address of a node is a 5-digit nonnegative integer, and NULL is represented by -1.

Then N lines follow, each describes a node in the format:

Address Data Next

where Address is the position of the node, Data is an integer, and Next is the position of the next node.

Output Specification:

For each case, output the resulting ordered linked list. Each node occupies a line, and is printed in the same format as in the input.

Sample Input:

00100 6 4
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218

Sample Output:

00000 4 33218
33218 3 12309
12309 2 00100
00100 1 99999
99999 5 68237
68237 6 -1

C++:

/*
 @Date    : 2018-02-09 11:35:33
 @Author  : 酸饺子 (changzheng300@foxmail.com)
 @Link    : https://github.com/SourDumplings
 @Version : $Id$
*/

/*
https://www.patest.cn/contests/pat-a-practise/1074
 */

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <memory>

using namespace std;

struct Node
{
    Node(int a, int d, int n): addr(a), data(d), next(n) {}
    int addr, data, next;
};


int main(int argc, char const *argv[])
{
    map<int, shared_ptr<Node>> d;
    vector<shared_ptr<Node>> vl;
    int startAddr, N, K;
    scanf("%d %d %d", &startAddr, &N, &K);
    for (int i = 0; i != N; ++i)
    {
        int addr, data, next;
        scanf("%d %d %d", &addr, &data, &next);
        d.insert(make_pair(addr, make_shared<Node>(addr, data, next)));
    }
    for (int i = 0; i != N; ++i)
    {
        vl.push_back(d[startAddr]);
        startAddr = vl.back()->next;
        if (startAddr == -1)
            break;
    }
    for (unsigned i = 0; i + K <= vl.size(); i += K)
        reverse(vl.begin() + i, vl.begin() + i + K);
    for (unsigned i = 0; i != vl.size() - 1; ++i)
    {
        vl[i]->next = vl[i+1]->addr;
    }
    vl.back()->next = -1;
    for (unsigned i = 0; i != vl.size() - 1; ++i)
        printf("%05d %d %05d\n", vl[i]->addr, vl[i]->data, vl[i]->next);
    printf("%05d %d -1\n", vl.back()->addr, vl.back()->data);

    return 0;
}