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
谷歌翻译:
给定一个常数 K和一个单链表L,你应该扭转每个链接上的K个元素大号。例如,给定如果为1→2→3→4→5→6K = 3,则必须输出3→2→1→6→5→4;如果K = 4,必须输出4→3→2→1→5→6。
输入规格:
每个输入文件包含一个测试用例。对于每种情况,第一行都包含第一个节点的地址,N(≤ 1 0
5
),它是总数量的节点,以及正K(≤ Ñ),它是子列表的长度可以颠倒。节点的地址是5位非负整数,并且NULL表示为-1。
然后 N行,每行以一种格式描述一个节点:
Address Data Next
其中,Address是节点的位置,Data是整数,Next是下一个节点的位置。
输出规格:
对于每种情况,输出结果排序后的链表。每个节点占用一行,并以与输入中相同的格式打印。
样本输入:
00100 6 4
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218
样本输出:
00000 4 33218
33218 3 12309
12309 2 00100
00100 1 99999
99999 5 68237
68237 6 -1
作者:陈越
单位:浙江大学
时间限制:400毫秒
内存限制:64 MB
代码长度限制:16 KB
**解析:本题有两个难点: 1,数据的存放需要采用结构体数组;2,给出的数据中存在与链表不相关的结点(就是指地址不能与其他结点产生联系的结点),需要把这些不相关的结点排除。
以下是AC代码**
#include <stdio.h>
#define MAX 100010
struct L_Node {
int Data;
int Next;
};
typedef struct L_Node Node;
Node a[MAX]; //建立结构体数组
int List[MAX];
void reverse(int *List, int a, int b);
void swap(int *a, int *b);
int main() {
int N, K, i, j, address, first;
scanf("%d %d %d", &first, &N, &K);
for (i = 0; i < N; i++) {
scanf("%d", &address);
scanf("%d %d", &a[address].Data, &a[address].Next);
}
//重点 :将所有结点连接起来,同时排除不相干的结点
int p = first;
j = 1;
while (p != -1) {
List[j++] = p;
p = a[p].Next;
}
i = 0;
j--;
while (i + K <= j) {
reverse(List, i + 1, i + K);
i += K;
}
for (i = 1; i < j; i++) {
printf("%05d %d %05d\n", List[i], a[List[i]].Data, List[i + 1]); //按照题目标准输入格式
}
printf("%05d %d -1", List[i], a[List[i]].Data);
return 0;
}
//翻转函数
void reverse(int *List, int a, int b) {
while (a < b) {
swap(&List[a++], &List[b--]); //传入指针修改List[]数组中的值
}
}
//交换函数
void swap(int *a, int *b) {
int temp = *a;
*a = *b;
*b = temp;
}