【 关关的刷题日记51】 Leetcode 67. Add Binary

class Solution {public:
    bool isPalindrome(string s) {
        if(s.empty() || s.size()==1)
            return true;
        for(int i=0, j=s.size()-1;i<j;)
        {
            //while(!(tolower(s[i])>='a' && tolower(s[i])<='z' || s[i]>='0' && s[i]<='9'))
            while(!(isalnum(s[i])))
                i++;
            //while(!(tolower(s[j])>='a' && tolower(s[j])<='z' || s[j]>='0' && s[j]<='9'))
            while(!(isalnum(s[j])))  
                j--;
            if(i<j)
            {
                if(tolower(s[i])==tolower(s[j]))
                {
                    i++;
                    j--;
                }
                else
                    return false;
            }
        }
        return true;
    }};