# 125. Valid Palindrome

## 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;
}
continue;
}
if(!isalphaordigit(s.at(tail))) {
tail--;
continue;
}
normalpha(s.at(tail));
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;
}

01-27 2660

08-14 2824

05-03 2076

01-30 625

06-28 210

04-26 313

03-26 1116

09-19 867

09-18 1378

11-07 583