入门经典-6.2链表-143-uva11988悲剧文本⭐⭐⭐⭐⭐难度：2

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int maxn=100000+5;
char s[maxn];
int Next[maxn];
int cur,Last;
int main(){
	while(scanf("%s",s+1)==1){
		int n=strlen(s+1);
		Last=cur=0;
		Next[0]=0;
		for(int i=1;i<=n;i++){
			if(s[i]=='[') cur=0;
			else if(s[i]==']') cur=Last;
			else {
				Next[i]=Next[cur];
				Next[cur]=i;
				if(cur==Last) Last=i;
				cur=i;
			}
		}
		
		for(int i=Next[0];i!=0;i=Next[i]){
			cout<<s[i];
		}
		cout<<endl;
	}
	return 0;
}