7-2 Reversing Linked List C++代码

题目出自 PTA 7-2 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
​​ ) 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

下面是代码实现，用了STL的vector和reverse
主要思路：
开辟一个充分大的结构数组，数组下标作为地址，结构数组每一个元素存放地址，数据，下一个结点地址。
读入数据后，把真正链入链表的结点按链表顺序从尾部压入vector容器（测试用例存在没有链入链表的结点，所以不能直接逆序），然后对vector每K个逆序，再顺序输出即可。

#include<iostream>
#include<vector>
#include<algorithm> 
using namespace std;

const int MAX = 100005;
typedef struct Node
{
	int add, data, next;
 }Node;


int main()
{
	Node Node[MAX];
	vector<struct Node>List;
	int head, N, K;
	cin>>head>>N>>K;
	
	//开一个足够大的数组，下标作为地址 
	for(int i=0; i<MAX; i++)
	{
		Node[i].add	= i;
	}
	
	int temp_add;
	

	for(int i=0; i<N; i++)
	{
		cin>>temp_add;
		cin>>Node[temp_add].data>>Node[temp_add].next;
		
	}
	
	//防止输入给出多余结点干扰逆序，只把链表上的点存入vector 
	int p = head;
	while(p!=-1)
	{
		List.push_back(Node[p]);
		p = Node[p].next;
		
	}
	
	int group = List.size()/K; //共逆序group组  
	vector<struct Node>::iterator p1;
	p1 = List.begin();
	for(int i=0; i<group; i++)
	{	
		reverse(p1 + i*K, p1 + i*K + K); //注意左闭右开 
		
	}
	
	//输出vector中存放的结点 
	for( ; p1!=List.end(); p1++)
	{
		printf("%05d %d ", (*p1).add, (*p1).data);
		if(p1 != List.end()-1)
		{
			printf("%05d\n", (*(p1+1)).add);//输出下一结点的地址， 此时结点存放的next由于逆序已经错误 
		}
		else
		{
			printf("-1");
		}
	 } 

	return 0;
}