UVA-11988 Broken Keyboard

 思路：

这题开始我自己创建单链表 超时 啧啧啧 可能是我太菜了 参考了笔者的答案（不愧是大牛）他使用的静态链表 轻松解决 就是代码有点难读 

#include<iostream>
#include<stack>
#include<queue>
#include<map>
#include<memory.h>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include<string>
#include<string.h>
using namespace std;
char arr[100005];
int next1[100005];
int main()
{
	while (scanf("%s", arr + 1) != EOF)
	{
		int n = strlen(arr+1);
		int first = 0;
		int last = 0;
		int cur = first;
		next1[0] = 0;
		for (int i = 1; i <= n; i++)
		{
			if (arr[i] == '[')
				cur = first;
			else if (arr[i] == ']')
				cur = last;
			else
			{
				next1[i] = next1[cur];    //此处i和cur 相当于指针
				next1[cur] = i;           //此为光标cur后插字符编号操作
				if (cur == last)    //更新尾指针
				{
					last = i;
				}
				cur = next1[cur];    //光标向后走
			}
		}
		for (int i = next1[0]; i != 0; i = next1[i])
			cout << arr[i];
		cout << endl;
	}
		return 0;
}