PAT A1074. Reversing Linked List (25)

最新推荐文章于 2024-07-30 17:23:09 发布

阿豪boy

最新推荐文章于 2024-07-30 17:23:09 发布

阅读量69

点赞数

文章标签：链表 python 算法数据结构 java

本文链接：https://blog.csdn.net/qq_35516360/article/details/122067452

版权

原文链接: PAT A1074. Reversing Linked List (25)

上一篇: PAT A1056. Mice and Rice (25)

下一篇: PAT A1032. Sharing (25)

1074. Reversing Linked List (25)

https://www.patest.cn/contests/pat-a-practise/1074

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

#include <iostream>
#include <cstdio>
const int MAX = 111111;
/*
data[i] 表示地址为i的节点的数值
next[i] 表示地址为i的节点的下一个节点地址
list[i] 是给定首节点的链表的节点地址序列
res[i]  是结果链表的节点地址序列
*/

int data[MAX], next[MAX], list[MAX], res[MAX];

int main(int argc, char *argv[]) {
	//first是第一个节点的地址,n是节点数,k是反转组数 
	int first, n, k;
	scanf("%d%d%d", &first, &n, &k);
	for (int i = 0; i < n; i++) {
		int t;
		scanf("%d", &t);
		scanf("%d%d", &data[t], &next[t]);
	}
	int count = 0;
	while (first != -1) {
		list[count++] = first;
		first = next[first];
	}

	//将list复制给res 
	for (int i = 0; i < count; i++)
		res[i] = list[i];

	//按照每k个节点反转	
	// i/k*k 表示第i个元素所在块的首地址, k-1-i%k 表示距离块尾的距离i 
	for (int i = 0; i < (count - count % k); i++) {
		res[i] = list[i / k * k + k - 1 - i % k];
	}

	for (int i = 0; i < count - 1; i++)
		printf("%05d %d %05d\n", res[i], data[res[i]], res[i + 1]);
	printf("%05d %d -1", res[count - 1], data[res[count - 1]]);
	return 0;
}