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.

用两个下标，i,j，j为最后一个元素的位置，如果不是字母或数字字符，则跳过。比较下标为i和j的两个元素。如果不相等，则不是回文，并跳出循环。因为题目忽略大小写，所以还要将大写字母换成小写字母。

class Solution {
public:
    bool isPalindrome(string s) {
        int len=s.size();
        int i=0,j=len-1;
        while(i<j){
            if(!((s[i]>='A'&&s[i]<='Z')||(s[i]>='a'&&s[i]<='z')||(s[i]>='0'&&s[i]<='9'))){
                i++;
                continue;
            }
            if(!((s[j]>='A'&&s[j]<='Z')||(s[j]>='a'&&s[j]<='z')||(s[j]>='0'&&s[j]<='9'))){
                j--;
                continue;
            }
            if(s[i]>='A'&&s[i]<='Z')
             s[i]=s[i]-'A'+'a';
            if(s[j]>='A'&&s[j]<='Z')
             s[j]=s[j]-'A'+'a';
            if(s[i]!=s[j]){
                return false;
               // break; 有没有都是accept
            }
            else{
            i++;j--;
            }
            
        }
        return true;
        
    }
};