双链表
作者:
amagi
,
2023-05-01 16:20:18
,
所有人可见
,
阅读 99
#include <iostream>
using namespace std;
const int N = 100100;
int e[N],l[N],r[N],idx;
//初始化
void init(){
r[0] = 1;
l[1] = 0;
idx = 2;
}
//下标是k的右边插入
void add(int k,int x){
e[idx] = x;
l[idx] = k;
r[idx] = r[k];
l[r[k]] = idx;
r[k] = idx;
idx ++;
}
//删除
void shan(int k){
r[l[k]] = r[k];
l[r[k]] = l[k];
}
int main(){
int a;
cin >> a;
init();
while(a --){
string k;
int kk;
int p;
cin >> k;
if(k == "L"){
cin >> p;
add(0,p);
}
else if(k == "R"){
cin >> p;
add(l[1],p);
}
else if(k == "D"){
cin >> p;
shan(p + 1);
}
else if(k == "IL"){
cin >> kk >> p;
add(l[kk + 1],p);
}
else if(k == "IR"){
cin >> kk >> p;
add(kk + 1,p);
}
}
for(int i = r[0]; i != 1; i = r[i]){
cout << e[i] << " ";
}
return 0;
}