AcWing 827. 双链表
原题链接
简单
作者:
piaofan
,
2021-01-22 17:03:47
,
所有人可见
,
阅读 358
#include<bits/stdc++.h>
using namespace std;
const int n = 100005;
int e[n], l[n], r[n], idx = 2;
void add (int k, int x) {
e[idx] = x;
r[idx] = r[k]; l[idx] = k;
l[r[k]] = idx; r[k] = idx++;
}
void del (int k) {
r[l[k]] = r[k];
l[r[k]] = l[k];
}
int main (void) {
r[0] = 1; l[1] = 0;
int m, x, k;
while (m--) {
string op;
cin >> op;
if (op == "L") {
cin >> x;
add(0, x);
}
if (op == "R") {
cin >> x;
add(l[1], x);
}
if (op == "D") {
cin >> k;
del(k + 1);
}
if (op == "IL") {
cin >> k >> x;
add(l[k + 1], x);
}
if (op == "IR") {
cin >> k >> x;
add(k + 1, x);
}
}
for (int i = r[0]; i != 1; i = r[i]) cout << e[i] << " ";
return 0;
}