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).

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

破碎的键盘，之前的c语言作业，当时就没过，然后一开始想用vector，但是这个插入不行，会T，然后用链表写了一下。。吐血，不知道为什么也会T；

会T的链表代码

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iomanip>
#include<cmath>
#include<float.h>
#include<string.h>
#include<algorithm>
#define sf scanf
#define pf printf
//#define pb push_back
#define mm(x,b) memset((x),(b),sizeof(x))
#include<vector>
#include<queue>
//#include<map>
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=a;i>=n;i--)
typedef long long ll;
typedef long double ld;
typedef double db;
const ll mod=1e9+100;
const db e=exp(1);
using namespace std;
const double pi=acos(-1.0);
char a[100005];
struct node
{
    char c;
    node *next;
};
int main()
{
    int x;
    while(~sf("%s",&a))
    {
        node *head,*now,*last,*p;
        head=new node;
        int temp=0;
        last=now=head;
        head->next =NULL;
        rep(i,0,strlen(a))
        {
            if(a[i]==‘[‘)
            {
                now=head;
                temp=1;
            }
            else if(a[i]==‘]‘)
            {
                now=last;
                temp=0;
            }
            else
            {
                p=new node;
                p->c =a[i];
                p->next=now->next ;
                now->next =p;
                now=p;
                if(temp==0)
                last=now;
                while(last->next!=NULL) last=last->next;
            }
        }
        last->next =NULL;
        p=head->next;
        while(p!=NULL)
        {
            pf("%c",p->c);
            now=p;
            p=p->next;
            free(now);
        }
        pf("\n");
    }
    return 0;

}

后面看到刘汝佳书上有讲这题，然后照着这种方法过了p143，用数组模拟链表，因为是从左到右的，所以可以只用一个NEXT数组储存右边跟着的字符的下表就好了；

AC的

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iomanip>
#include<cmath>
#include<float.h>
#include<string.h>
#include<algorithm>
#define sf scanf
#define pf printf
//#define pb push_back
#define mm(x,b) memset((x),(b),sizeof(x))
#include<vector>
#include<queue>
//#include<map>
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=a;i>=n;i--)
typedef long long ll;
typedef long double ld;
typedef double db;
const ll mod=1e9+100;
const db e=exp(1);
using namespace std;
const double pi=acos(-1.0);
char s[100005];
int NEXT[100005],last,cur;
int main()
{
    int n,last,cur;

    while(sf("%s",s+1)!=EOF)
    {
         n=strlen(s+1);
        last=cur=0;
        NEXT[0]=0;
        for(int i=1;i<=n;i++)
        {
            if(s[i]==‘[‘)
            cur=0;
            else if(s[i]==‘]‘)
            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])
        pf("%c",s[i]);
        pf("\n");
    }
    return 0;
}

原文地址：https://www.cnblogs.com/wzl19981116/p/9403866.html