PAT 1074. 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⁵) 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
//旋转链表，这题通过率比较低

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cstring>
using namespace std;
struct Node
{
	int data;
	int next;
};
Node node[100000];//也可以使用unordered_map<int, Node> node;
int position[100000];//记录相应位置处元素的下标
int main(void)
{
	int head, n, k;
	scanf("%d%d%d", &head, &n, &k);
	int add;
	for (int i = 0; i < n; ++i)
	{
		scanf("%d", &add);
		scanf("%d%d", &node[add].data, &node[add].next);
	}
	int index = head;
	int i = 0;
	while (index != -1)
	{
		position[i++] = index;
		index = node[index].next;
	}
	int count = i;//这条链表上有count个元素
	i = 0;
	while (i <= count - k)//注意i <= count - k，写为i < count - k则会有两个案例通不过
	{
		reverse(position + i, position + i + k);
		i += k;
	}
	if (count > 0)
		printf("%05d %d", position[0], node[position[0]].data);
	for (int i = 1; i < count; ++i)
		printf(" %05d\n%05d %d", position[i], position[i], node[position[i]].data);
	printf(" -1\n");
	return 0;
}