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:
    int isChar(char c) {
        if (c >= 'a'&& c <= 'z') {
            return c;
        } else if (c >= 'A' && c <= 'Z') {
            return c + 'a' - 'A';
        } else if (c >= '0' && c <= '9'){
            return c;
        } else {
            return -1;
        }
    }
    
    bool isPalindrome(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int low = 0;
        int high = s.size() - 1;
        while (low <= high) {
            while (low < high && -1 == isChar(s[low])) ++low;
            while (low < high && -1 == isChar(s[high])) --high;
            if (low <= high) {
                if (isChar(s[low]) == isChar(s[high])) {
                    ++low;
                    --high;
                }
                else {
                    return false;
                }
            }
        }
        return true;
    }
};