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 (≤105) 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<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int node[100002][2];
int main()
{
int list[100002];
int i;
int st,k;
int n;
cin>>st>>n>>k;//输入起始地址、节点数以及反转的长度k
for(i=0;i<n;i++){
int add,data,next;
cin>>add>>data>>next;//输入地址、数据、以及下一节点
node[add][0]=data;//存入二维数组
node[add][1]=next;
}
int cnt=0;
int cur=st;
while(cur!=-1){
list[cnt++]=cur;
cur=node[cur][1];//将下一节点逐渐插入
}
i=0;
while(i+k<=cnt){
reverse(list+i,list+i+k);
i+=k;
}
for(i=0;i<cnt-1;i++){
printf("%05d %d %05d\n",list[i],node[list[i]][0],list[i+1]);
}
printf("%05d %d -1",list[i],node[list[i]][0]);
return 0;
}
解析:这道题目的大概意思很容易就看懂了,就是我在第一行输入的是第一个节点的地址,节点数还有要反转的长度k
然后我们需要把无序的n组数据按照链表的形式变成有序的,并且在有序的同时要将节点的地址作出修改。