1074 Reversing Linked List (25分)
作者:CHEN, Yue
单位:浙江大学
代码长度限制:16 KB
时间限制:200 ms
内存限制:64 MB\
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
题意:
将指定个数的链表反转。
思路:
地址为5位数,用静态链表来做这题,先遍历链表将链表地址记录下来(为了确定反转的结点都是链表中的点),然后将记录下来的地址按照要求利用reverse函数进行反转(反转链表只要把地址反转就行了,后面只要输出,不用把链表再连上)。
参考代码:
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct Node {
int address, data, next;
} node[100010];
int main() {
int head, n, k, address, cnt = 0;
scanf("%d%d%d", &head, &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &address);
scanf("%d%d", &node[address].data, &node[address].next);
node[address].address = address;
}
vector<int> v;
while (head != -1) {
v.push_back(head);
head = node[head].next;
}
for (int i = 1; i <= v.size(); i++) {
cnt++;
if (cnt % k == 0) {
reverse(v.begin() + i - cnt, v.begin() + i);
cnt = 0;
}
}
for (int i = 0; i < v.size(); i++) {
if (i == v.size() - 1) {
printf("%05d %d -1\n", v[i], node[v[i]].data);
continue;
}
printf("%05d %d %05d\n", v[i], node[v[i]].data, node[v[i + 1]].address);
}
return 0;
}
如有错误,欢迎指正