02-线性结构3 Reversing Linked List

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

分析

本题其实就是一个链表的具体化，第一行输入了第一个结点的地址、结点个数N、翻转数K，接着输入N个结点信息，我们可以用一个结构体数组来整合结点信息，数组下标作为结点地址。本题可以先把各个结点的先后顺序理清楚，也就是将各个结点地址按照先后顺序存入List数组中，然后再按照每K个翻转一次，得到新的先后顺序。这里为了省事，所以我用了c++的reverse函数进行翻转，其实这个函数也不难实现。

代码

#include<iostream>
#include<cstdio>
#include<algorithm>    //使用到 reverse 翻转函数
using namespace std;
 
#define MAXSIZE 100010   
 
struct node    //使用顺序表存储data和下一地址next
{
   int data;   
   int next;
}node[MAXSIZE];
 
int List[MAXSIZE];


int main()
{
	int First,Address,Data,Next;
	int K,N,j=0;
	cin>>First>>N>>K;
	while(N--)
	{
		cin>>Address>>Data>>Next;
		node[Address].data=Data;
		node[Address].next=Next;
	}
	 
    int p=First;   ///p指示当前结点的地址
    while(p!=-1)
    {
        List[j++]=p;//List中存入各结点地址 
        p=node[p].next;
    }
    int i=0;
    while(i+K<=j)   ///每k个节点做一次翻转
    {
        reverse(&List[i],&List[i+K]);
        i=i+K;
    }
    for(i=0;i<j-1;i++)
        printf("%05d %d %05d\n",List[i],node[List[i]].data,List[i+1]);
        
    printf("%05d %d -1\n",List[i],node[List[i]].data);//最后一个结点的next为-1，没有存入list中，需要特殊处理 
    return 0;	
}