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.

判断字符串是否是回文，只判断字母和数字。 这里用栈操作，先把大写字母转换成小写，然后入栈，入栈的同时生成一个新的只包含字母和数字的字符串，判断的时候一个一个出栈如果与字符串中的每一个都相同，就是回文。

class Solution {
public:
    bool isPalindrome(string s) {
        if (s.empty()) return true;
        string str = "";
        stack<char> m_stack;
        for (int i = 0; i < s.length(); ++i)
        {
            s[i] = tolower(s[i]);
            if (s[i] <= 'z' && s[i] >= 'a' || s[i] <= '9' && s[i] >= '0')
            {
                m_stack.push(s[i]);
                str += s[i];
            }
        }
        for (int i = 0; i < str.length(); ++i)
        {
            if (str[i] != m_stack.top())
                return false;
            m_stack.pop();
        }
        return true;
    }
};