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

最新推荐文章于 2022-08-22 18:08:03 发布

codekun

最新推荐文章于 2022-08-22 18:08:03 发布

阅读量653

点赞数

分类专栏： + 数据结构文章标签： ACM C++ 算法入门 OJ

本文链接：https://blog.csdn.net/kun768/article/details/41692501

版权

+ 数据结构专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Problem B

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

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

int main()
{
    string in;
    while(cin >> in)
    {
        list<char> str;
        list<char>::iterator pos = str.begin();
        for(auto i : in)
        {
            if(i=='[')
                pos = str.begin();
            else if(i==']')
                pos = str.end();
            else
            {
                pos = str.insert(pos, i);
                pos++;
            }

        }
        for(auto i : str)
            cout << i ;
        cout << endl;
    }
    return 0;
}

书上的方法，链表实现，速度更快。。

#include <cstdio>
#include <iostream>
#include <cstring>
#define MAXN 102400

int last, cur, next[MAXN];
char str[MAXN];

int main()
{
	while (memset(next, 0, sizeof(next)), scanf("%s", str + 1) == 1)
	{
		int len = strlen(str+1);
		last = cur = 0;

		for (int i = 1; i <= len; i++)
		{
			char ch = str[i];
			if (ch == '[')
				cur = 0;
			else if (ch == ']')
				cur = last;
			else
			{
				next[i] = next[cur];
				next[cur] = i;
				if (cur == last)
					last = i;
				cur = i;
			}
		}
		for (int i = next[0]; i != 0; i = next[i])
			printf("%c", str[i]);
		putchar('\n');
	}
}