#include <stdio.h>
#include <string.h>
#include <stdlib.h>
char s[1005], a[1005];
int p = 0;
int max(int a, int b){return a > b ? a : b;}
int main()
{
int len, i;
while(gets(s))
{
len = strlen(s);
for(i = 0; i <= len; i++)
{
if(s[i] == '#')
{
p--;
p = max(0, p);
}
else if(s[i] == '@')p = 0;
else a[p++] = s[i];
}
printf("%s\n", a);
}
return 0;
}
SDUT - 1479 数据结构实验之栈与队列九:行编辑器
猜你喜欢
转载自blog.csdn.net/Miracle_QSH/article/details/81866814
今日推荐
周排行