826.单链表

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+10;
int ne[N],e[N],idx,m,head;
void init(){
	head = -1;
	idx = 0;
}
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(){
	scanf("%d",&m);
	init();
	while(m--){
		char t;
		cin>>t;
		int k,x;
		if(t=='H'){
			cin>>x;
			add_to_head(x);
		}
		else if(t=='D'){
			cin>>k;
			if(k==0)head = ne[head];
			else remove(k-1);
		}
		else{
			cin>>k>>x;
			add(k-1,x);
		}
	}
	for(int i = head;i!=-1;i = ne[i])cout<<e[i]<<" ";
}

826. 单链表 - AcWing题库