Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
For example,
“A man, a plan, a canal: Panama” is a palindrome.
“race a car” is not a palindrome.
Note:
Have you consider that the string might be empty? This is a good question to ask during an interview.
For the purpose of this problem, we define empty string as valid palindrome.
方法:two pointer
class Solution {
public:
bool isPalindrome(string s) {
for(int i = 0 ; i < s.size() ; ++i){
if(s[i]>='A'&&s[i]<='Z'){
s[i]+=32;
continue;
}
else if (s[i]>='a'&&s[i]<='z')
continue;
else if(s[i]>='0'&&s[i]<='9')
continue;
else
s.erase(i--,1);
}
int first = 0 , last = s.size() - 1;
while(first<last){
if(s[first++]!=s[last--])
return false;
}
return true;
}
};