19年冬季第二题 PAT甲级 1165 Block Reversing (25分) 跟1133类似的题目

最新推荐文章于 2023-06-01 10:43:07 发布

浒鱼鱼

最新推荐文章于 2023-06-01 10:43:07 发布

阅读量1.4k

点赞数 1

分类专栏： PAT甲级文章标签： 2019年冬季考试链表数据结构算法 c++

本文链接：https://blog.csdn.net/allisonshing/article/details/104116640

版权

这篇博客介绍了PAT甲级编程题1165 Block Reversing，要求对每K个节点为一个块的链表进行反转。文章提供了输入输出规格，并给出了样例输入和输出。博主分享了解题思路，包括与另一题目的相似之处，以及一种优化解法的链接，同时提到了该优化解法在处理最后一个测试点时存在的问题。

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

题目

Given a singly linked list L. Let us consider every K nodes as a block (if there are less than K nodes at the end of the list, the rest of the nodes are still considered as a block). Your job is to reverse all the blocks in L. For example, given L as 1→2→3→4→5→6→7→8 and K as 3, your output must be 7→8→4→5→6→1→2→3.

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 (≤10e5) which is the total number of nodes, and a positive K (≤N) which is the size of a block. 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 i