【PAT甲级】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 (≤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

思路：数组模拟链表，使用algorithm的reverse()反转链表

代码：

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define drep(i,n,a) for(int i=n;i>=a;i--)
#define mem(a,n) memset(a,n,sizeof(a))
#define lowbit(i) ((i)&(-i))
typedef long long ll;
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const double eps = 1e-6;
const int N = 1e5+5;

int lt[N];
int Node[N][2];
int main() {
    int head,K,L,address;
    scanf("%d%d%d",&head,&L,&K);
    for(int i=0; i<L; i++) {
        scanf("%d",&address);
        scanf("%d%d",&Node[address][0],&Node[address][1]);
    }
    int cnt=0;
    while(head!=-1) {
        lt[cnt++]=head;
        head=Node[head][1];
    }
//    printf("cnt=%d L=%d\n",cnt,L);
    for(int i=0; i+K<=cnt; i+=K) {///注意这里是cnt,不能是L，cnt表示的是链表的首节点，L表示节点个数—— cnt<=L
        reverse(lt+i,lt+i+K);///反转链表
    }
    for(int i=0; i<cnt-1; i++) {
        printf("%05d %d %05d\n",lt[i],Node[lt[i]][0],lt[i+1]);
    }
    printf("%05d %d -1\n",lt[cnt-1],Node[lt[cnt-1]][0]);
    return 0;
}