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.
我的做法:
brute force,好的,不出意外地time out了...
认真看了一下,其实这个time out问题不是出在检查回文上,而是出在检查是不是字母数字上,所以用了正则表达式,就ok了。
速度还可以,暂时就不改进了。
就是一头一尾同时扫描,没有什么trivial的。