02-线性结构3 Reversing Linked List (25 分)（C语言）

原创

已于 2022-03-17 19:33:01 修改 · 1.3k 阅读

3 ·

CC 4.0 BY-SA版权

文章标签：

#链表 #leetcode #数据结构

于 2022-03-17 19:32:21 首次发布

这篇博客介绍了如何使用C语言解决LeetCode上的一个问题——每K个节点反转链表。文章提供了输入输出规范，并展示了一个案例。作者最初尝试直接修改链表，但超时，后来改用不直接修改链表的方法，给出了相关代码和解释。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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: