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.length() == 0) return true;
for (int i = 0, j = s.length() - 1; i < j; i++, j--) {
while (i < j && !isalnum(s[i])) i++;
while (i < j && !isalnum(s[j])) j--;
if (toupper(s[i]) != toupper(s[j])) return false;
}
return true;
}
};