这篇博客介绍了一种处理链表问题的方法，即如何根据给定的步长K逆向链表中的每K个元素。作者给出了具体的操作过程，并提供了一个示例代码，该代码利用C++中的`reverse`函数实现链表的翻转。代码中，链表节点存储数据和下一个节点的位置，并用顺序表辅助操作。虽然代码在本地环境运行正常，但在提交时遇到了运行错误，作者寻求帮助并分享了其他人的解决方案。
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 (≤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:
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 th
最低0.47元/天 解锁文章
扫一扫
125
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
