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.

给定一个字符串，在只考虑字母和数字的情况下判断其是否为回文。

例如

"A man, a plan, a canal: Panama" 是回文
"race a car" 不是回文

注意：

你考虑过字符串为空的情况吗？对于这道题，字符串为空返回true。

懒得想了，于是直接上栈和队列，把符合条件的字符全部push进去之后一个个判断就好，时间和空间复杂度都是O(n)

class Solution {
public:
    bool isPalindrome(string s) {
        stack<char> stk;
        queue<char> que;
        for(int i=0;i<s.length();i++)
            if(s[i]>='a'&&s[i]<='z'||s[i]>='A'&&s[i]<='Z'||s[i]>='0'&&s[i]<='9')
            {
                if(s[i]>='A'&&s[i]<='Z')
                    s[i]+=32;
                stk.push(s[i]);
                que.push(s[i]);
            }
        while(!stk.empty())
        {
            if(stk.top()!=que.front()) return false;
            stk.pop();
            que.pop();
            
        }
        return true;
    }
};