15.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.

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.

分析：题目是要判定一个字符串是否是回文，且忽略空格和标点符号，只判断字母和数字，注意不区分大小写，比如“Aa”是回文，空字符串是回文。

解题：其实就是定义i和j，分别指向串头和串尾，判定是否一样，不一样则返回false，一样则i和j同时往中间移位，直至i>=j

核心部分：string::size_type i=0,j=s.size()-1;
        while(i<j){
            while(i<j&&!isalnum(s[i])){
                i++;
            }
            while(i<j&&!isalnum(s[j])){
                j--;
            }
            if(i>=j){
                break;
            }
            if(tolower(s[i])!=tolower(s[j])){
                return false;
            }
            i++;
            j--;
        } 
        return true;