2019.12.7PAT冬季考试第二题 - 7-2 Block Reversing (25分)

Given a singly linked list L. Let us consider every K nodes as a block (if there are less than K nodes at the end of the list, the rest of the nodes are still considered as a block). Your job is to reverse all the blocks in L. For example, given L as 1→2→3→4→5→6→7→8 and K as 3, your output must be 7→8→4→5→6→1→2→3.

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 size of a block. 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 8 3
71120 7 88666
00000 4 99999
00100 1 12309
68237 6 71120
33218 3 00000
99999 5 68237
88666 8 -1
12309 2 33218

Sample Output:

71120 7 88666
88666 8 00000
00000 4 99999
99999 5 68237
68237 6 00100
00100 1 12309
12309 2 33218
33218 3 -1

作者: 陈越

单位: 浙江大学

时间限制: 400 ms

内存限制: 64 MB

代码长度限制: 16 KB

这是一道块链表反转的题，也是自己比较有思路的一道题。

1.自己的解法

数组block_begin[]和block_end[]，记录每个块的起点和终点的位置，然后将起点和终点反转即可，链表内部不需要动。

// ConsoleApplication4.cpp : 定义控制台应用程序的入口点。
//


#include<cstdio>
#include<vector>
#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<string>
using namespace std;

const int maxn = 100010;
int block_begin[maxn];
int block_end[maxn];
struct Node{
	int data, next;
}node[maxn];
/*
00100 8 3
71120 7 88666
00000 4 99999
00100 1 12309
68237 6 71120
33218 3 00000
99999 5 68237
88666 8 -1
12309 2 33218
*/

int main(){
	int root_addr, n, k;
	cin>>root_addr>>n>>k;
	for(int i =0; i < n; i++){
		int addr, data, next;
		scanf("%d%d%d",&addr,&data,&next);
		node[addr].data = data;
		node[addr].next = next;
	}
	int block = 0; // block 1~n
	int final_num;
	if( n % k == 0){
		block = n / k;
		final_num = k;
	}
	else{
		block = n / k + 1;
		final_num = n % k;
	}
	int cur_ptr = root_addr;
	int cnt = 0;
	int block_idx = 1; // from 1 to n
	while(cur_ptr != -1){
		cnt++;
		if(cnt % k == 1) block_begin[block_idx] = cur_ptr;
		if(cnt % k == 0 || cnt == n) block_end[block_idx++] = cur_ptr;
		cur_ptr = node[cur_ptr].next;
	}
	root_addr = block_begin[block_idx - 1];

	for(int i = block_idx - 1; i >= 1; i--){
		if(i == 1)
		{node[block_end[i]].next = -1;}
		else
			node[block_end[i]].next = block_begin[i - 1];
	}
	
	cur_ptr = root_addr;
	while(cur_ptr != -1){
		if(node[cur_ptr].next != -1)
			printf("%05d %d %05d\n",cur_ptr, node[cur_ptr].data, node[cur_ptr].next);
		else
			printf("%05d %d %d\n",cur_ptr, node[cur_ptr].data, node[cur_ptr].next);
		cur_ptr = node[cur_ptr].next;
	}
	return 0;
}

 2大神的解法

使用sort的方法巧妙将链表反转：三阶排序：1.is0k 2.group 3.index

对于这道题来说，主要是group比较重要。

太巧妙了！在Node的结构里直接加入{group、index}，初始化后进行排序！

#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
struct Node {
	int data,address,next;
	int isOk;
	int group, index;
	Node (){
		isOk=0;
	}
}node[100010];
bool cmp(Node a, Node b){
	if (a.isOk!=b.isOk) return a.isOk>b.isOk;
	else if (a.group!=b.group) return a.group>b.group;
	else return a.index<b.index;
}
int main(){
	int n,k;
	int begin;
	scanf("%d %d %d",&begin, &n, &k);
	for (int i=0; i<n; i++){
		int address, data, next;
		scanf("%d %d %d",&address, &data, &next);
		node[address].data=data;
		node[address].address=address;
		node[address].next=next;
	}
	int p=begin;
	int cnt=0;
	//group a[group][index]
	while (p!=-1){
		node[p].group=cnt/k;
		node[p].index=cnt%k;
		cnt++;
		node[p].isOk=1;
		p=node[p].next;
	}
	sort(node, node+100010, cmp);
	for (int i=0; i<cnt; i++){
		if (i!=cnt-1){
			printf("%05d %d %05d\n",node[i].address, node[i].data, node[i+1].address);
		}else {
			printf("%05d %d -1\n",node[i].address, node[i].data);
		}
	}
	return 0;
}

 

3总结

链表题可以巧妙的使用sort的多级排序功能，出其不意！