Problem B

Problem Description

  Polycarp thinks about the meaning of life very often. He does this constantly, even when typing in the editor. Every time he starts brooding he can no longer fully concentrate and repeatedly presses the keys that need to be pressed only once. For example, instead of the phrase "how are you" he can type "hhoow aaaare yyoouu".

  Polycarp decided to automate the process of correcting such errors. He decided to write a plug-in to the text editor that will remove pairs of identical consecutive letters (if there are any in the text). Of course, this is not exactly what Polycarp needs, but he's got to start from something!

  Help Polycarp and write the main plug-in module. Your program should remove from a string all pairs of identical letters, which are consecutive. If after the removal there appear new pairs, the program should remove them as well. Technically, its work should be equivalent to the following: while the string contains a pair of consecutive identical letters, the pair should be deleted. Note that deleting of the consecutive identical letters can be done in any order, as any order leads to the same result.

Input

The first line is an integer T(T<=50)--The number of test cases.
For each of the test case,there is a single string,the length of the line is from 1 to 2*10^5 characters inclusive. The string contains only lowercase Latin letters.

Output

For each of the test case,print the given string after it is processed.It is guaranteed that the result will contain at least one character.

Sample Input

3
hhoowaaaareyyoouu
reallazy
abacabaabacabaa

Sample Output

wre
rezy
a

模拟堆栈操作

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
using namespace std; 
#define maxn 200010

char stk[maxn];
char str[maxn];
int main()
{
	int t;
	int j;
	int i;
	int len;
	scanf("%d",&t);
	while(t--)
	{
		memset(stk,0,sizeof(stk));
		scanf("%s",str);
		j=1;
		len=strlen(str);
		for(i=0;i<len;i++)
		{
			if(stk[j-1]!=str[i])
			{
				stk[j]=str[i];
				j++;
			}
			else 
			{
				stk[j-1]=0;
				j--;
			}
		}
		stk[j]='\0';
		for(i=1;i<j;i++)
			printf("%c",stk[i]);
		printf("\n");
	}
	return 0; 
}



评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值