125. Valid Palindrome

Description:
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.

Note: For the purpose of this problem, we define empty string as valid palindrome.

Solution:
两个指针法，注意字符串“0P”，两个字符相减刚好是32。
先把字符都变成小写，可以去除大小写32的问题。

class Solution {
public:
    bool isPalindrome(string s) {
        if (s.empty())    
            return true;
        int l = 0, r = s.length() - 1;
        while (l < r) {
            if (!isalnum(s[l])) {
                ++ l;
                continue;
            }   
            if (!isalnum(s[r])) {
                -- r;
                continue;
            }   
            if ((s[l] == s[r]) || (isalpha(s[l]) && (s[l] - s[r] == 32 || s[r] - s[l] == 32))) {
                ++ l;
                -- r;
            } else {
                return false;
            }   
        }   
        return true;
    }
};