[AcWing 826] 单链表

---

点击查看代码

#include<iostream>

using namespace std;
const int N = 1e5 + 10;
int head, idx;
int e[N], ne[N]; 
void init()
{
    head = -1;
    idx = 0;
}
void add_to_head(int x)
{
    e[idx] = x;
    ne[idx] = head;
    head = idx;
    idx ++;
}
void remove(int k)
{
    ne[k] = ne[ne[k]];
}
void add(int k, int x)
{
    e[idx] = x;
    ne[idx] = ne[k];
    ne[k] = idx;
    idx ++;
}
int main()
{
    int m;
    scanf("%d", &m);
    init();
    while (m --) {
        char op;
        int k, x;
        cin >> op;
        if (op == 'H') {
            scanf("%d", &x);
            add_to_head(x);
        }
        else if (op == 'D') {
            scanf("%d", &k);
            if (!k)     head = ne[head];
            else        remove(k - 1);
        }
        else {
            scanf("%d %d", &k, &x);
            add(k - 1, x);
        }
    }
    for (int i = head; i != -1; i = ne[i])  printf("%d ", e[i]);
    return 0;
}

---

1. 使用数组模拟单链表；