数据结构：单链表

题目描述

输入样例

10
H 9
I 1 1
D 1
D 0
H 6
I 3 6
I 4 5
I 4 5
I 3 4
D 6

输出样例

6 4 6 5

参考代码

#include<iostream>

using namespace std;

const int N = 100010;

int head, idx;
int e[N], ne[N];

int m;
char op[2];

void init()
{
    head = -1;
    idx = 1;
}

void add_to_head(int x)
{
    e[idx] = x; ne[idx] = head; head = idx; idx++;
}

void add(int k, int x)
{
    e[idx] = x; ne[idx] = ne[k]; ne[k] = idx; idx++;
}

void remove(int k)
{
    ne[k] = ne[ne[k]];
}

int main()
{   
    init();
    scanf("%d", &m);
    
    while (m -- )
    {
        scanf("%s", &op);
        if (op[0] == 'H')
        {
            int x;
            scanf("%d", &x);
            add_to_head(x);
        }
        else if (op[0] == 'D')
        {
            int k;
            scanf("%d", &k);
            if (!k) head = ne[head];
            remove(k);
        }
        else
        {
            int k, x;
            scanf("%d%d", &k, &x);
            add(k, x);
        }
    }
    
    for (int i = head; i != -1; i = ne[i]) printf("%d ", e[i]);
    puts("");
    
    return 0;
}