PAT甲级——1074 Reversing Linked List

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:

00100 6 4
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218

Sample Output:

00000 4 33218
33218 3 12309
12309 2 00100
00100 1 99999
99999 5 68237
68237 6 -1

思路：首先用结构体来构造静态链表，每个结构体额外定义了一个order变量用来存储每个数据在链表中的顺序，遍历链表得到每一个结点的order ，计数器count得到有效结点的个数。n/k的值为完整的倒序排列数，我们先按顺序输出每一段前k-1个数据，第k个结点的next值需要分情况来判定，如果该段不是最后一段，那么第k个结点的next值指向下一段（还未倒序）的最末尾元素，如果是最后一段，且n/k==0（链表最后即没有不完整段的小尾巴）那么该结点的next值为-1，如果最后还有小尾巴，由于小尾巴阶段的个数小于k，所以不参与倒序，那么该结点的next值就是小尾巴的第一个结点的地址。最后别忘了还要将小尾巴顺序输出。

代码：

#include <iostream>
#include<algorithm>
using namespace std;
const int maxn = 100010;

struct Node{
	int address, data, next;
	int order;
}node[maxn];

bool cmp(Node a, Node b)
{
	return a.order < b.order;
}

int main()
{
	for (int i = 0; i < maxn; i++) {
		node[i].order = maxn;
	}
	int begin, n, k;
	scanf("%d%d%d", &begin, &n, &k);
	int address, data, next;
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &address);
		scanf("%d%d", &node[address].data, &node[address].next);
	}
	int p = begin,count=0;
	while (p!=-1)
	{
		node[p].order = count++;
		p = node[p].next;
	}
	sort(node, node + maxn, cmp);
	
	for (int i = 0; i < n / k; i++)
	{
		for (int j = (i + 1)*k - 1; j > i*k; j--)
		{
			printf("%05d %d %05d\n", node[i].address, node[i].data, node[i].next);
		}
		printf("%05d %d", node[i*k].address, node[i*k].data);
		if (i < n/k- 1) {
			printf(" %05d\n", node[(i + 2)*k - 1].address);
		}
		else {
			if (n / k == 0)
			{
				printf(" -1\n");
			}
			else {
				printf(" %05d\n", node[(i + 1)*k].address);
				for (int i = n / k * k; i < n; i++)
				{
					printf("%05d %d", node[i].address, node[i].data);
					if(i<n-1)
					{
						printf(" %05d\n", node[i].next);
					}
					else {
						printf(" -1\n"); 
					}
				}
			}
		}
	}
	return 0;
}