中国大学MOOC-陈越、何钦铭-数据结构(第二次课2-2)

 02-线性结构3 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 (≤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:

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

• 结尾无空行

 C语言实现：

#include <stdio.h>
#define MaxSize 100000
int main()
{
	int Data[MaxSize];
	int Next[MaxSize];
	int first, n, k;
	scanf("%d%d%d", &first, &n, &k);
	for (int i = 0; i < n; i++)
	{
		int tmpAdd, tmpData, tmpNext;
		scanf("%d%d%d", &tmpAdd, &tmpData, &tmpNext);
		Data[tmpAdd] = tmpData;
		Next[tmpAdd] = tmpNext;
	}
	int list[MaxSize];
	int sum = 0; 
	while (first != -1) 
	{
		list[sum++] = first;
		first = Next[first];
	}
	for (int i = 0; i < sum - sum % k; i += k)
	{
		for (int j = 0; j < k / 2; j++) 
		{
			int t = list[i + j];
			list[i + j] = list[i + k - j - 1];
			list[i + k - j - 1] = t;
		}
	}
	for (int i = 0; i < sum - 1; i++)
	{
		printf("%05d %d %05d\n", list[i], Data[list[i]], list[i + 1]);
	}
	printf("%05d %d -1\n", list[sum - 1], Data[list[sum - 1]]);
	return 0;
}