第十四题 UVA11988 破损的键盘 Broken Keyboard (a.k.a. Beiju Text)

PDF

终于看到数据结构了…第一篇 链表

恩 链表是个好东西

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

//书上看到链表了， 上学的时候链表就没学好，这回都得补上 gg

#include<cstring>
#include<cstdio>
#include<iostream>
#define Maxn 120005
using namespace std;
int Nxt[Maxn],cur,last;
char s[Maxn];
//cur 不代表遍历到的位置 而是遍历到的i位应该输出到cur的右侧
//last 记录最靠右的位置， 以便cur随时可以"回来" 
int main(int argc,char *argv[]) {
	while(scanf("%s", s + 1) == 1) {
		int len = strlen (s + 1);
		cur = last = 0;
		Nxt[0] = 0;
		for(int i=1; i<=len; i++) {
			char ch = s[i];
			if(ch == '[') cur = 0;
			else if(ch == ']') cur = last;
			else {
				Nxt[i] = Nxt[cur];
				Nxt[cur] = i;
				if(cur == last) last = i;
				cur = i;
			}
		}
		for(int i=Nxt[0]; i!=0; i=Nxt[i]) 
			printf("%c",s[i]);
		printf("\n");
	} 
	return 0;
}