PTA Reversing Linked List

题目不难，总是出现一些细节上的问题。这题卡了好几天了，心里很难受。最终还是决定看答案。

不管会不会，一定要在有限的时间AC掉，超过一定的时间，那就是不会，根本没有必要再去硬啃，不然会很受打击，前期还是多积累经验，重在练基础。到了后面应该就能啃出来了。

题目：

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