BUCTOJ_ACM2017C 回文串的热爱

提示：扫一扫查出行
【扫一扫了解最新限行尾号】
复制提示

#include "iostream"
#include "algorithm"
#include "cstdio"
#include "cstring"
using namespace std;int main()
{
string s;
int n;
cin >> n;
while(n--)
{
cin >> s;
int len;
int flag = ;
len = s.length();
for(int i=;i < len/;i++)
{
if(s[i] != s[len-i-])
flag++;
}
if(flag == && len% == )
cout << "YES"<<endl;
else if(flag == )
cout << "YES"<< endl;
else
cout << "NO"<<endl;
}
return ;
}