[Leetcode 38] 125 Valid Palindrome

Problem:

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:

Get two pointer pi, pj, pi points to the head of the string, pj points to the end of the string. 

Then compare the two pointed characters, if they are the same, then pi++, pj--, repeat the comparision.

If they are not the same, return false;

Code:

class Solution {
public:
    bool isPalindrome(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (s == "") return true;
        
        int i = 0, j = s.size()-1;
        while (true) {
            while (!((s[i]>='0'&&s[i]<='9') || (s[i]>='a' && s[i]<='z')
                    || (s[i]>='A' && s[i]<='Z')))
                    if ((i++) >= s.size()) break;
                    
            while (!((s[j]>='0'&&s[j]<='9') || (s[j]>='a' && s[j]<='z')
                    || (s[j]>='A' && s[j]<='Z')))
                    if ((j--) < 0) break;
                    
            if (i >= j) break;
            
            if (toLower(s[i]) != toLower(s[j]))
                return false;
            
            i++;
            j--;
        }
        
        return true;
    }
    
    char toLower(char a) {
        if (a>='A' && a<= 'Z')
            a += 32;
            
        return a;
    }
    
    
};

Attention: