报错看不太明白 PTA题目 《数据结构》02-线性结构3 Reversing Linked List

题目
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 ^5 
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

#include <stdio.h>
#include <string.h>
int main()
{
	char str[10];
	scanf("%s",str);
	int n,m;
	scanf("%d %d",&n,&m);
	struct listnode{
		char ch[10];
		int a;
        char c[10];
	}node[n+5],temp;
	int i,j;
	for(i=0;i<n;i++){
		scanf("%s %d %s",node[i].ch,&node[i].a,node[i].c);
	}
	for(j=0;j<n;j++){
		if(strcmp(str,node[j].ch)==0)
		{
			temp=node[0];node[0]=node[j];node[j]=temp;
			break;
		}
	}
	for(j=0;j<n-1;j++){
		for(i=j+1;i<n;i++)
		if(strcmp(node[j].c,node[i].ch)==0){
			temp=node[j+1];node[j+1]=node[i];node[i]=temp;
			break;
		}
	}
	for(i=m-1;i>1||i==1;i--)
	printf("%s %d %s\n",node[i].ch,node[i].a,node[i-1].ch);
	printf("%s %d %s\n",node[0].ch,node[0].a,node[m-1].c);
	for(i=m;i<n;i++)
	{
		printf("%s %d %s\n",node[i].ch,node[i].a,node[i].c);
	}
	
	
		
	
	
	
}

错误信息

https://ask.csdn.net/questions/7424206?spm=1005.2025.3001.5141

参考这个写法

 也许对你有帮助：https://blog.csdn.net/it_xiangqiang/category_10768339.html