Skip to content

Reversing Linked List

题目链接：1074 Reversing Linked List (25 point(s))

题干大意

翻转链表

思路

利用reverse函数即可。注意喜欢使用cout的，如何控制输出格式，以及用"\n"输出换行会减少时间。

AC代码

C++
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;

const int MaxN = 1e6 + 10;
struct node {
    int data{};
    int next{};
} l[MaxN];

int main()
{
    int         first, N, K;
    vector<int> res;
    cin >> first >> N >> K;
    int address;
    for (int i = 0; i < N; ++i) {
        cin >> address >> l[address].data >> l[address].next;
    }
    while (first != -1) {
        res.emplace_back(first);
        first = l[first].next;
    }
    for (int i = 0; i + K <= res.size(); i += K)
        reverse(res.begin() + i, res.begin() + i + K);
    for (int i = 0; i < res.size() - 1; ++i)
        cout << setw(5) << setfill('0') << res[i] << " " << l[res[i]].data << " " << setw(5) << setfill('0')
             << res[i + 1] << "\n";

    cout << setw(5) << setfill('0') << res[res.size() - 1] << " " << l[res[res.size() - 1]].data << " " << -1;
    return 0;
}