1074 Reversing Linked List（PAT Advanced）

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

不借助外部数组、直接对链表进行操作的解法：

#include <cstdio>
#include <iostream>
#include <vector>

using namespace std;

#define MAX_N 100010

struct MemNode {
	int data;
	int next;
};

MemNode mem[MAX_N];

int main() {
	int n, k;
	MemNode head_node;

	cin >> head_node.next >> n >> k;

	int tmp_addr;
	for (int i = 0; i < n; i++)
	{
		cin >> tmp_addr;
		cin >> mem[tmp_addr].data >> mem[tmp_addr].next;
	}

	MemNode *tmp_head_node; // 兼容头结点，使用指针
	int curr_node_idx = head_node.next; // 对于数组模拟的链表的特殊处理
	vector<int> idx_stack;
	tmp_head_node = &head_node;

	while (curr_node_idx != -1) {
		idx_stack.push_back(curr_node_idx);
		curr_node_idx = mem[curr_node_idx].next;
		if (idx_stack.size() == k) {
			for (int i = 0; i < k; ++i) {
				tmp_head_node->next = idx_stack.back();
				tmp_head_node = &(mem[idx_stack.back()]);
				idx_stack.pop_back();
			}
		}
	}

	if (idx_stack.size() > 0) {
		tmp_head_node->next = idx_stack[0];
	}
	else {
		tmp_head_node->next = -1;
	}

	curr_node_idx = head_node.next;
	while (curr_node_idx != -1) {
		printf("%05d %d ", curr_node_idx, mem[curr_node_idx].data);
		curr_node_idx = mem[curr_node_idx].next;
		if (curr_node_idx == -1) {
			printf("-1");
		}
		else {
			printf("%05d\n", curr_node_idx);
		}
	}

	return 0;
}