代码讲解:
#include <iostream>
using namespace std;
const int N = 100000 + 10;
int e[N], ne[N], head, idx;
//初始化:
void init()
{
head = -1;
idx = 0;
}
//将x插入到头节点上:
void add_to_head(int x)
{
e[idx] = x;
ne[idx] = head;
head = idx;
idx++;
}
//将x插入到下标为k的节点后面
void insert(int k, int x)
{
e[idx] = x;
//插入到k后面,那就将节点指向k节点的下一个节点
ne[idx] = ne[k];
//再将原来指向下一节点的指向当前要插入的节点
ne[k] = idx++;
}
//删除操作:删除下标为k的节点的下一个节点
void remove(int k)
{
ne[k] = ne[ne[k]];
}
int main()
{
int m;
scanf("%d\n", &m);;
init();
while (m--)
{
int k = 0, x; char op;
scanf("%c", &op);
if (op == 'H')
{
scanf("%d\n", &x);
add_to_head(x);
}
else if (op == 'D')
{
scanf("%d\n", &k);
if (k == 0) head = ne[head];
else remove(k - 1);
}
else
{
scanf("%d%d\n", &k, &x);
insert(k - 1, x);
}
}
for (int i = head; i != -1; i = ne[i]) printf("%d ", e[i]);
printf("\n");
return 0;
}
关于上面的插入头节点操作: