给定一个常数 K 以及一个单链表 L,请编写程序将 L 中每 K 个结点反转。例如:给定 L 为 1→2→3→4→5→6,K 为 3,则输出应该为 3→2→1→6→5→4;如果 K 为 4,则输出应该为 4→3→2→1→5→6,即最后不到 K 个元素不反转。
输入格式:
每个输入包含 1 个测试用例。每个测试用例第 1 行给出第 1 个结点的地址、结点总个数正整数 N (≤105)、以及正整数 K (≤N),即要求反转的子链结点的个数。结点的地址是 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
C:
#include <stdio.h>
#define MAX 100000
int n, m;
int h, e[MAX], ne[MAX], q[MAX + 10];
int main() {
scanf("%d%d%d", &h, &n, &m);
for (int i = 0; i < n; i++) {
int address, data, next;
scanf("%d%d%d", &address, &data, &next);
e[address] = data;
ne[address] = next;
}
int cnt = 0;
for (int i = h; i != -1; i = ne[i]) {
q[cnt++] = i;
}
for (int i = 0; i < cnt; i += m) {
if (i + m - 1 < cnt) {
for (int l = i, r = i + m - 1; l < r; l++, r--) {
int temp = q[l];
q[l] = q[r];
q[r] = temp;
}
}
}
for (int i = 0; i < cnt; i++) {
if (i != cnt - 1) {
printf("%05d %d %05d\n", q[i], e[q[i]], q[i + 1]);
} else {
printf("%05d %d -1\n", q[i], e[q[i]]);
}
}
return 0;
}
C++:
#include <bits/stdc++.h>
using namespace std;
int n,m;
int h,e[100000],ne[100000],q[100010];
int main()
{
scanf("%d %d %d",&h,&n,&m);
for(int i=0;i<n;i++)
{
int address,data,next;
scanf("%d %d %d",&address,&data,&next);
e[address]=data;
ne[address]=next;
}
int cnt=0;
for(int i=h;i!=-1;i=ne[i])
{
q[cnt++]=i;
}
for(int i=0;i<cnt;i=i+m)
{
if(i+m-1<cnt)
{
reverse(q+i,q+i+m);
}
}
for(int i=0;i<cnt;i++)
{
if(i!=cnt-1)
{
printf("%05d %d %05d\n",q[i],e[q[i]],q[i+1]);
}
else
{
printf("%05d %d %d\n",q[i],e[q[i]],-1);;
}
}
return 0;
}
Java:
import java.util.Scanner;
public class Main {
static final int MAX = 100000;
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n, m;
int h;
int[] e = new int[MAX];
int[] ne = new int[MAX];
int[] q = new int[MAX + 10];
h = scanner.nextInt();
n = scanner.nextInt();
m = scanner.nextInt();
for (int i = 0; i < n; i++) {
int address = scanner.nextInt();
int data = scanner.nextInt();
int next = scanner.nextInt();
e[address] = data;
ne[address] = next;
}
int cnt = 0;
for (int i = h; i != -1; i = ne[i]) {
q[cnt++] = i;
}
for (int i = 0; i < cnt; i += m) {
if (i + m - 1 < cnt) {
for (int l = i, r = i + m - 1; l < r; l++, r--) {
int temp = q[l];
q[l] = q[r];
q[r] = temp;
}
}
}
for (int i = 0; i < cnt; i++) {
if (i != cnt - 1) {
System.out.printf("%05d %d %05d\n", q[i], e[q[i]], q[i + 1]);
} else {
System.out.printf("%05d %d -1\n", q[i], e[q[i]]);
}
}
}
}
Python:
n, m = map(int, input().split())
h = int(input())
e = [0] * 100000
ne = [0] * 100000
q = [0] * 100010
for _ in range(n):
address, data, next_node = map(int, input().split())
e[address] = data
ne[address] = next_node
cnt = 0
i = h
while i != -1:
q[cnt] = i
cnt += 1
i = ne[i]
for i in range(0, cnt, m):
if i + m - 1 < cnt:
l, r = i, i + m - 1
while l < r:
q[l], q[r] = q[r], q[l]
l += 1
r -= 1
for i in range(cnt):
if i != cnt - 1:
print("%05d %d %05d" % (q[i], e[q[i]], q[i+1]))
else:
print("%05d %d -1" % (q[i], e[q[i]]))