UVa 11988 数组模拟链表

 1 // UVa11988 Broken Keyboard
 2 // Rujia Liu
 3 #include<cstdio>
 4 #include<cstring>
 5 const int maxn = 100000 + 5;
 6 int last, cur, next[maxn]; // 光标位于cur号字符之后面
 7 char s[maxn];
 8 
 9 int main() {
10   while(scanf("%s", s+1) == 1) {
11     int n = strlen(s+1); // 输入保存在s[1], s[2]...中
12     last = cur = 0;
13     next[0] = 0;
14 
15     for(int i = 1; i <= n; i++) {
16       char ch = s[i];
17       if(ch == ‘[‘) cur = 0;
18       else if(ch == ‘]‘) cur = last;
19       else {
20         next[i] = next[cur];
21         next[cur] = i;
22         if(cur == last) last = i; // 更新“最后一个字符”编号
23         cur = i; // 移动光标
24       }
25     }
26     for(int i = next[0]; i != 0; i = next[i])
27       printf("%c", s[i]);
28     printf("\n");
29   }
30   return 0;
31 }