Leetcode 125. 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.

解法很简单，主要是积累两个函数：一个用来判断字符是不是字母（包括大小写）或数字，isalnum(); 一个是将小写字母转大写字母，toupper()，另外将大写转小写字母函数为，tolower().

class Solution {
public:
    bool isPalindrome(string s) {
       for(int i=0,j=s.size()-1;i<j;++i,--j){
           while(!isalnum(s[i])&&i<j)
                ++i;
           while(!isalnum(s[j])&&i<j)
                --j;
           if(toupper(s[i])!=toupper(s[j]))   
                return false;
       }
       return true;
    }
};
}