UVA11988 紫书例题6-4 破损的键盘（Broken Keyboard (a.k.a. Beiju Text)）

**

Broken Keyboard (a.k.a. Beiju Text)

**

You’re typing a long text with a broken keyboard. Well it’s not so badly broken. The only problem with the keyboard is that sometimes the “home” key or the “end” key gets automatically pressed (internally).

You’re not aware of this issue, since you’re focusing on the text and did not even turn on the monitor! After you finished typing, you can see a text on the screen (if you turn on the monitor).

In Chinese, we can call it Beiju. Your task is to find the Beiju text.

Input

There are several test cases. Each test case is a single line containing at least one and at most 100,000 letters, underscores and two special characters ‘[’ and ‘]’. ‘[’ means the “Home” key is pressed internally, and ‘]’ means the “End” key is pressed internally. The input is terminated by end-of-file (EOF). The size of input file does not exceed 5MB.

Output

For each case, print the Beiju text on the screen.

Sample Input

This_is_a_[Beiju]_text
[[]][][]Happy_Birthday_to_Tsinghua_University

Output for the Sample Input

BeijuThis_is_a__text
Happy_Birthday_to_Tsinghua_University

题目大意：

你在输入文章的时候，键盘上的Home键和End键出了问题，会不定时的按下。给你一段按键的文本，其中’[‘表示Home键，’]‘表示End键，输出这段悲剧的文本。
也即：顺序扫描悲剧字符串，当遇到普通字符，则直接存储；当遇到’[‘字符时，表示’[‘后面的字符需要插入到前面已扫描存储字符的前部；当遇到’]‘字符时，表示’]'后面的字符需要放置在已扫描存储字符的后面。

解题思路：

最简单的做法是用数组来保存这段文本，然后顺序扫描文本，将’[’ ']‘中间的文本插入到前面文本的前部，但这种做法会超时。
解决方案是： 链表
我们可以采用数组Next[maxn]模拟一个静态链表来存储已经扫描的字符，设输入字符串是S[i], 则可以用Next[i]对应表示字符S[i]在最终的字符串中的下一个字符的索引（即在S中的下标）。
这里用Next[0]作为链表的头节点，其中存储这链表第一个节点的索引。再用一个变量cur表示当前索引位置，用一个变量last指示链表尾节点。然后顺序遍历输入的字符串S,当遇到正常字符时，采用尾插法插入到静态链表Next中。当遇到’['时，则表示以后的字符需要插入到头节点的后面。则将cur = 0，然后继续扫描；

#include <cstdio>
#include <cstring>

const int maxn = 100000 + 5;
char S[maxn];    //保存输入的字符串
int Next[maxn]; //静态链表
int cur, last;  //cur为当前访问的索引，last为链表尾索引

int main(){
    while(scanf("%s", (S + 1)) == 1){
        int n = strlen(S + 1);  //字符串存储在S[1]，S[2]，...
        cur = last = 0;
        Next[0] = 0;

        for(int i = 1; i <= n; i++){
            char ch = S[i];
            if(ch == '['){
                cur = 0;
            }else if(ch == ']'){
                cur = last;
            }else{
                // 下两句类似于链表的头插法
                Next[i] = Next[cur];
                Next[cur] = i;
                //插入完毕，索引后移
                if(cur == last){    //只有当cur也在尾部时才需要将last后移
                    last = i;
                }
                cur = i;    //移动索引
            }
        }
        for(int i = Next[0]; i != 0; i = Next[i]){
            printf("%c", S[i]);
        }
        printf("\n");
    }
    return 0;
}