AcWing 826. 单链表
原题链接
简单
作者:
piaofan
,
2021-01-22 15:05:15
,
所有人可见
,
阅读 322
#include<bits/stdc++.h>
using namespace std;
const int n = 100005;
int e[n], ne[n], head = -1, idx = 0;
void ath (int x) {
e[idx] = x; ne[idx] = head; head = idx++;
}
void add (int k, int x) {
e[idx] = x; ne[idx] = ne[k]; ne[k] = idx++;
}
void del (int k) { ne[k] = ne[ne[k]]; }
int main(void) {
int m, x, k;
cin >> m;
while (m--) {
char op;
cin >> op;
if (op == 'H') {
cin >> x;
ath(x);
}
if (op == 'D') {
cin >> k;
if (k == 0) head = ne[head];
else del(k - 1);
}
if (op == 'I') {
cin >> k >> x;
add(k - 1, x);
}
}
for (int i = head; i != -1; i = ne[i]) cout << e[i] << " ";
return 0;
}