《数据结构》02-线性结构3 Reversing Linked List

最新推荐文章于 2024-07-11 12:23:05 发布

叫我皮卡丘

最新推荐文章于 2024-07-11 12:23:05 发布

阅读量1w

点赞数 50

CC 4.0 BY-SA版权

分类专栏：数据结构数据结构（浙大）文章标签： Reversing Linked List 数据结构浙江大学链表 PAT

本文链接：https://blog.csdn.net/liyuanyue2017/article/details/83269991

题目

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