PAT A1074 Reversing Linked List (25分)

最新推荐文章于 2024-11-05 21:58:11 发布

CSHran

最新推荐文章于 2024-11-05 21:58:11 发布

阅读量142

点赞数

分类专栏： PAT 文章标签：算法

本文链接：https://blog.csdn.net/rhao999/article/details/105301217

版权

PAT 专栏收录该内容

183 篇文章 0 订阅

订阅专栏

本文介绍了一种算法，用于解决链表中每K个元素进行翻转的问题。通过读取链表节点，存储地址、数据和下一个节点的位置，然后根据给定的K值进行翻转操作，最后输出翻转后的链表。代码使用C++实现，通过数组存储节点信息，再进行链表的反转。

摘要由CSDN通过智能技术生成

题目链接：https://pintia.cn/problem-sets/994805342720868352/problems/994805394512134144

题目描述
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 L being 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.

输入
Each input file contains one test case. For each case, the first line contains the address of the first node, a positive N (≤10⁵ ) 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.

输出
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.

样例输入
00100 6 4
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218

样例输出
00000 4 33218
33218 3 12309
12309 2 00100
00100 1 99999
99999 5 68237
68237 6 -1

代码

#include <iostream>
#include <algorithm>
using namespace std;
int main() {
    int first, k, n, temp;
    cin >> first >> n >> k;
    int data[100005], next[100005], list[100005];
    for (int i = 0; i < n; i++) {
        cin >> temp;
        cin >> data[temp] >> next[temp];
    }
    int sum = 0;
    while (first != -1) {
        list[sum++] = first;
        first = next[first];
    }
    for (int i = 0; i < (sum - sum % k); i += k)
        reverse(begin(list) + i, begin(list) + i + k);
    for (int i = 0; i < sum - 1; i++)
        printf("%05d %d %05d\n", list[i], data[list[i]], list[i + 1]);
    printf("%05d %d -1", list[sum - 1], data[list[sum - 1]]);
    return 0;
}