uva 11988 Broken Keyboard（字符串处理+ STL）

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

题目大意：碰到‘['读入放在字符串的前面，碰到‘]'读入放在字符串的后面。

解题思路：一道字符串处理的题目，但是根据特点可以借助STL里面的list来做。

#include <stdio.h>
#include <list>
#include <string.h>
#define N 100010
using namespace std;

int main(){
    char str[N];
    list<char> lst;
    list<char>::iterator it;

    while (gets(str) != NULL){
	int len = strlen(str);
	it = lst.begin();
	for (int i = 0; i < len; i++)
	    if(str[i] == '[')
		it = lst.begin();
	    else if(str[i] == ']')
		it = lst.end();
	    else
		lst.insert(it, str[i]);
	
	while (!lst.empty()){
	    putchar(lst.front());
	    lst.pop_front();
	}	
	putchar('\n');

    }
    return 0;}