题目链接
关键点:
1、题目要求的是删除相邻且相同的字母,那么我们将可以删除的次数记下来,发现:若为奇数则输出“Yes”,偶数为"No";
2、开一个vis数组来标记该位置的字符串已经被删除,遍历一遍字符串,若出现相同的两个字母,且这两个字母未被标记,则次数加一,且。接下来判断这两给字母的旁边的两个字母,如果也相同,且未被标记,则次数继续加1,然后继续判断,直到不满足为止
完整代码
# include <cstdio>
# include <iostream>
# include <cstring>
using namespace std;
int n;
int vis[1000000];
int main()
{
string s;
scanf("%d", &n);
while (n--)
{
cin>>s;
memset(vis, 0, sizeof(vis));
int cnt = 0;
for (int i=0; i<s.size(); i++)
{
if (s[i]==s[i+1]&&(!vis[i])&&(!vis[i+1]))
{
cnt++;
vis[i] = vis[i+1] = 1;
int l = i-1, r = i+2;
while (1)
{
while (vis[l]&&l>=0)
l--;
while (vis[r]&&r<s.size())
r++;
if (l<0||r>=s.size())
break;
else
{
if (s[r]==s[l])
{
cnt++;
vis[r] = vis[l] = 1;
l = l-1;
r = r+1;
}
else
break;
}
}
}
}
// cout<<cnt<<endl;
if (n>=1)
{
if (cnt%2)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
else
{
if (cnt%2)
cout<<"Yes";
else
cout<<"No";
// cout<<"1"<<endl;
}
}
return 0;
}