AcWing 826. 单链表
原题链接
简单
作者:
整天睡大觉
,
2024-03-04 13:22:05
,
所有人可见
,
阅读 17
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100010;
int n;
int h, e[N], ne[N], idx;
void init()
{
h = -1;
idx = 0;
}
//将x插入到头节点后面
void add_to_head(int x)
{
e[idx] = x;
ne[idx] = h;
h = idx;
idx ++;
}
//将x插入到下标为k的点的后面
void add(int k, int x)
{
e[idx] = x;
ne[idx] = ne[k];
ne[k] = idx;
idx ++;
}
//将下标为k的节点移除
void remove(int k)
{
ne[k] = ne[ne[k]];
}
int main()
{
cin >> n;
init();
while (n -- )
{
char s;
cin >> s;
if(s == 'H')
{
int x;
cin >> x;
add_to_head(x);
}
if(s == 'D')
{
int k;
cin >> k;
if(!k) h = ne[h];
else remove(k - 1);
}
if(s == 'I')
{
int x, k;
cin >> k >> x;
add(k - 1, x);
}
}
for (int i = h; i != -1; i = ne[i]) cout << e[i] << ' ' ;
cout << endl;
return 0;
}