#include
#include
#include
using namespace std;
class Solution {
public: bool isPlodrome(string s)
{
int len = s.length();
if (len == 0)
return true;
auto p = &s[0];
auto q = &s[len - 1];
int alpha = 0;
for (int i = 0;i < len;i++)
{
if (isalpha(s[i]))
{
alpha++;
if(isupper(s[i]))
s[i]=s[i]+(‘a’-‘A’);
}
}
if (alpha == 0)
return true;
if (alpha == 1)
return true;
if (len == 2)
{
if (*q == *p && alpha == 2)
return true;
return false;
}
while (q - p >= 1)
{
if (!isalpha(*p))
{
p++;
continue;
}
if (!isalpha(*q))
{
q–;
continue;
}
if (*p == *q)
{
p++;
q–;
continue;
}
else
{
return false;
break;
}
}
return true;
}
};//“OP是leetcode的系统错误,测试可以过但是提交过不了”
int main(void)
{
string str;
cout << "please input the string : ";
getline(cin, str);
Solution s;
cout << s.isPlodrome(str);
return 0;
}