浙大数据结构MOOC作业题目集2020——02-线性结构3 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
​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<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct stu{
	int num;
	int next;
}stu1[100001];
int main(){
	 int start,n,count=0,a,b,c,i;
	 vector<int> list; 
	scanf("%d %d %d",&start,&n,&count);
	 for(int i=0;i<n;i++){
	 scanf("%d %d %d",&a,&b,&c);
	 	stu1[a].num=b;
	 	stu1[a].next=c;
	 }
	 n=0;
	 while(start!=-1){
	 	list.push_back(start);
	 	start=stu1[start].next;
	 	n++;	
	}
	list.push_back(-1);
	int j=0;
	while(j+count<=n){
		reverse(list.begin()+j,list.begin()+j+count);
		j=j+count;
	}
	for(i=0;i<n-1;i++)
	printf("%05d %d %05d\n",list[i],stu1[list[i]].num,list[i+1]);
	printf("%05d %d %d\n",list[i],stu1[list[i]].num,list[i+1]);
	

}