Broken Keyboard (a.k.a. Beiju Text) UVA - 11988

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.

Sample Input

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

Sample Output

BeijuThis_is_a__text
Happy_Birthday_to_Tsinghua_University

HINT

字符’['将链表指针置于头，字符’]‘将链表指针置于尾部。插入字符用insert(pos,var)；第一个参数是一个指针，指向要插入的地址前面，后面的是要插入的值。返回插入的地址。

Accepted

#include<bits/stdc++.h>
using namespace std;

int main(){
	string s;
	while (getline(cin, s) && s.length()) {
		list<char>L;
		auto p = L.begin();
		for (int i = 0;i < s.length();i++) {
			if (s[i] == '[')p = L.begin();
			else if (s[i] == ']')p = L.end();
			else {
				p=L.insert(p, s[i]);
				p++;
			}
		}
		for (p = L.begin();p != L.end();p++)cout << *p;
		cout << endl;
	}
}