AcWing 826. 单链表
原题链接
简单
作者:
dsyami
,
2021-05-11 11:11:20
,
所有人可见
,
阅读 229
#include <iostream>
using namespace std;
const int N = 1e5 + 10;
int m, head, e[N], ne[N], idx;
void init()
{
head = -1;
}
void insert_head(int x)
{
e[idx] = x;
ne[idx] = head;
head = idx ++;
}
void del(int k)
{
if(k != -1)
{
ne[k] = ne[ne[k]];
}
else
{
head = ne[head];
}
}
void insert(int k, int x)
{
e[idx] = x;
ne[idx] = ne[k];
ne[k] = idx ++;
}
int main()
{
cin >> m;
init();
while(m -- )
{
char op;
int k, x;
cin >> op;
if(op == 'H')
{
cin >> x;
insert_head(x);
}
else if(op == 'D')
{
cin >> k;
del(k - 1);
}
else if(op == 'I')
{
cin >> k >> x;
insert(k - 1, x);
}
}
for(int i = head; i != -1; i = ne[i])
{
int j = e[i];
cout << j << " ";
}
return 0;
}