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<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 100100;
struct Node{int address,data,next;int order;
}node[maxn];bool cmp(Node a,Node b){return a.order < b.order;
}
int main(){int i,address;for(i = 0; i < maxn; i++){node[i].order = maxn;}int begin,n,k;  //起始节点地址，节点数目，分组数 scanf("%d%d%d",&begin,&n,&k);for(i = 0; i < n; i++){scanf("%d",&address);scanf("%d%d",&node[address].data,&node[address].next);node[address].address = address;}int p = begin,count = 0;while(p != -1){node[p].order = count++;p = node[p].next;}sort(node,node+maxn,cmp);n = count; //因为count=0占一个有效节点，退出循环时，count值就是有效节点 for(i = 0; i < n/k; i++){ //枚举完整的n/k块 for(int j = (i+1)*k - 1; j > i*k; j-- ){ //每块的第i个倒着输出，剩余最后一个节点 printf("%05d %d %05d\n",node[j].address,node[j].data,node[j-1].address);}printf("%05d %d ",node[i*k].address,node[i*k].data); //每块的最后一个节点的前两项数据 if(i < n/k -1)  { //如果是非最后一块节点 printf("%05d\n",node[(i+2)*k-1].address);}else{   //如果是最后一块节点 if(n % k == 0) printf("-1\n");  //刚好除整 else{   //如果最后一个节点不规则 printf("%05d\n",node[(i+1)*k].address);for(i = n/k*k; i < n; i++){printf("%05d %d ",node[i].address,node[i].data);if(i < n - 1){printf("%05d\n",node[i+1].address);}else{printf("-1\n");}// else} // for(i)}//else}//else} //for(i)return 0;
}

转载于:https://www.cnblogs.com/wanghao-boke/p/8550233.html

1074. Reversing Linked List (25)相关推荐

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 elem ...
1074. Reversing Linked List (25)-PAT甲级真题
Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elem ...
1074 Reversing Linked List (25 分) java 题解
Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elem ...
1074 Reversing Linked List (25 分)【难度: 一般 / 知识点: 链表】
https://pintia.cn/problem-sets/994805342720868352/problems/994805394512134144 乙级里面的原题吧,就用哈希表建链表,reve ...
PAT 1074 Reversing Linked List
1074 Reversing Linked List (25point(s)) Given a constant K and a singly linked list L, you are suppo ...
PAT甲级1074 Reversing Linked List ：[C++题解]反转链表，借用vector
文章目录题目分析题目链接题目分析分析:数组模拟链表,这题反转操作在数组中进行,然后直接输出即可,甚至不用放回到链表. //遍历链表,该链表用数组模拟 //保存链表结点地址到数组中 for(in ...
每隔k次反转一次链表_PTA 5-2 Reversing Linked List (25) [法一] - 线性表 - 链表反转 (PAT 1074)...
Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elem ...
PAT-A 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 elem ...
02-线性结构3 Reversing Linked List (25 分)
如果单纯从做题角度来讲,上一个做法当然没问题,可是目的是为了练习静态链表,so还是不要投机取巧了,静态链表解法如下: #include <stdio.h> struct data {in ...

1074. Reversing Linked List (25)

1074. Reversing Linked List (25)相关推荐

最新文章

热门文章