125. Valid Palindrome
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.
Analysis:
回文体里算比较简单的题目应该。
Source Code(C++):
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
using namespace std;
class Solution {
public:
bool isPalindrome(string s) {
if (s.empty()){
return true;
}
int head=0, tail=s.size()-1;
while(head<tail) {
if(!isalphaordigit(s.at(head))) {
head++;
continue;
}
if(!isalphaordigit(s.at(tail))) {
tail--;
continue;
}
normalpha(s.at(head));
normalpha(s.at(tail));
if (s.at(head)==s.at(tail)){
head++;
tail--;
}
else {
return false;
}
}
return true;
}
bool isalphaordigit(char c) {
if ((c>='A' && c<='Z') || (c>='a' && c<='z') || ((c>='0' && c<='9'))){
return true;
}
else {
return false;
}
}
void normalpha(char &c) {
if (c>='A' && c<='Z'){
c += 'a'-'A';
}
}
};
int main() {
Solution sol;
cout << sol.isPalindrome("");
cout << sol.isPalindrome(".,");
cout << sol.isPalindrome("abCBA");
cout << sol.isPalindrome("12aa21");
return 0;
}