Uva11988 Broken Keyboard 链表

#pragma warning(disable:4786)
#pragma comment(linker, "/STACK:102400000,102400000")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<cmath>
#include<string>
#define LL long long
#define FOR(i,f_start,f_end) for(int i=f_start;i<=f_end;++i)
#define mem(a,x) memset(a,x,sizeof(a))
#define lson l,m,x<<1
#define rson m+1,r,x<<1|1
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double PI = acos(-1.0);
const double eps=1e-8;
const int maxn = 1e5 + 5;
char s[maxn];
int nt[maxn];
int main()
{
    while(scanf("%s",s+1)!=EOF){
        mem(nt , 0);
        int cur = 0 , last = 0;
        int len = strlen(s + 1);
        for(int i = 1;i<= len ; i++){
            if(s[i]=='['){
                cur = 0;
            }
            else if(s[i]==']'){
                cur = last;
            }
            else{
                nt[i] = nt[cur];
                nt[cur]  = i;<span style="white-space:pre">		</span>//链表节点的插入：先插尾再插头
                if(cur == last)
                    last = i;
                cur = i;
            }
        }
        for(int i = nt[0] ; i!=0 ; i = nt[i]){<span style="white-space:pre">		</span>//链表的顺序访问，此处 0 相当于空指针NULL
            printf("%c",s[i]);
        }
        printf("\n");
    }
    return 0;
}