PTA 数据结构倒置链表（数组存储节点，创建链表。）

最新推荐文章于 2021-10-15 11:10:52 发布

loveAC233

最新推荐文章于 2021-10-15 11:10:52 发布

阅读量262

点赞数

文章标签：数据结构

本文链接：https://blog.csdn.net/loveAC233/article/details/88635185

版权

该博客介绍了一种使用数组存储节点并按指定步长K倒置链表的方法。给定一个单链表L和正整数K，需要将每K个元素的链接反转。例如，链表1→2→3→4→5→6，当K=3时，输出3→2→1→6→5→4；若K=4，则输出4→3→2→1→5→6。输入包含链表首节点地址、节点总数N（≤105）和子列表长度K（≤N）。输出按照倒置后的链表顺序显示每个节点的信息。

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

02-线性结构3 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 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.

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 (≤105) 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: