125. Valid Palindrome

没啥好说的，求回文串，处理一下string就ok

class Solution {
public:
    bool isPalindrome(string s) {
        if(s.length() == 0) return true;;
        string ss = "";
        for(int i = 0; i < s.length(); ++ i){
            if(s[i] >= '0' && s[i] <= '9')
                ss += s[i];
            else if(s[i] >= 'a' && s[i] <= 'z')
                ss += s[i];
            else if(s[i] >= 'A' && s[i] <= 'Z'){
                char t = s[i] + 32;
                ss += t;
            }
        }
        int l = ss.length();
        for(int i = 0; i <= ss.length() / 2; ++ i)
            if(ss[i] != ss[l - i - 1])
                return false;
        return true;
    }
};