2017/7/22 Broken Keyboard(链表的数组实现）

题目描述：

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).

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

样例  Input：

This_is_a_[Beiju]_text

[[]][][]Happy_Birthday_to_Tsinghua_University

样例 Output：

BeijuThis_is_a__text

Happy_Birthday_to_Tsinghua_University

题目大意：

输入一行行字符串，‘[’表示回到文件头输入，‘]’表示到文件末尾输入。

用数组实现链表，做法很酷了。

	0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18
char s[]		T	h	i	s	_	i	s	[	B	e	i	j	]	t	e	x	t	\0
int next[]	9	2	3	4	5	6	7	14	0	10	11	10	1	0	15	16	17	0	0

 

#include <iostream>
#include<cstdio>
#include<cstring>

using namespace std;

int main()
{
    char s[100005];
    int next[100005];
    while(scanf("%s", s+1) == 1)
    {
        int i = 1, cur = 0, last = 0;
        next[0] = 0;
        while(s[i]!='\0')
        {
            if(s[i] == '[')
                cur = 0;
            else if(s[i] == ']')
                cur = last;
            else
            {
                next[i] = next[cur];
                next[cur] = i;
                cur = i;
                if(next[cur] == 0)
                    last = cur;
            }

            i++;
        }
        int pos = 0;
        while(next[pos])
        {
            pos = next[pos];
            printf("%c", s[pos]);
        }
        cout <<endl;
        for(i = 0; i < 22; i++)
            cout << next[i] << endl;
        cout << endl;
        memset(s,'\0',sizeof(s));
    }
    return 0;
}