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.

问题：要进行比对的只有字母和数字，其他的标点等特殊字符跳过，问这些数字和字母的序列是否为回文。

class Solution {public:    bool alphanumeric (char c)    {        return (c >= 'a' && c <= 'z' || c >= '0' && c <= '9');    }    void tolower(string &s)    {        for(int i = 0; i < s.size(); ++i)        if(s[i] <= 'Z' && s[i] >= 'A')        s[i] += 32;    }    bool isPalindrome(string s) {        if(s.size() <= 1) return true;        int i = 0;        int j = s.size() - 1;        tolower(s);        while(i <= j)        {            if(alphanumeric(s[i]) && alphanumeric(s[j]) && s[i] == s[j])            {++i; --j;}            else if(!alphanumeric(s[i])) ++i;            else if(!alphanumeric(s[j])) --j;            else  return false;        }        return true;    }};