1074 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
结尾无空行
reverse是个好东西ლ(´ڡ`ლ)~~~
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Node
{
public:
//Node(int a,int n,int ne):address(a),num(n),next(ne){};
int address;
int num;
int next;
};
Node node[100005];
int main()
{
int start_address,total,k;
cin>>start_address>>total>>k;
for(int i=0;i<total;i++)
{
int address,num,next;
cin>>address>>num>>next;
Node anode;
anode.address=address;anode.num=num;anode.next=next;
node[address]=anode;
}
vector<Node> vec;
int pos=start_address;
while(pos!=-1)
{
vec.push_back(node[pos]);
pos=node[pos].next;
}
for(int i=k-1;i<vec.size();i+=k)
{
int right=i+1;
int left=i-k+1;
reverse(vec.begin()+left,vec.begin()+right);
}
for(int i=0;i<vec.size()-1;i++)
vec[i].next=vec[i+1].address;
vec[vec.size()-1].next=-1;
for(int i=0;i<vec.size()-1;i++)
{
printf("%05d %d %05d\n",vec[i].address,vec[i].num,vec[i].next);
}
printf("%05d %d -1\n",vec[vec.size()-1].address,vec[vec.size()-1].num);
return 0;
}