文章作者:Tyan
博客:noahsnail.com | CSDN | 简书
1. Description
2. Solution
class Solution {
public:
bool isPalindrome(string s) {
int i = 0;
int j = s.length() - 1;
while(i < j) {
if(!isalnum(s[i])) {
i++;
continue;
}
if(!isalnum(s[j])) {
j--;
continue;
}
if(tolower(s[i]) == tolower(s[j])) {
i++;
j--;
}
else {
return false;
}
}
return true;
}
};