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) {
for(int i = 0, j = s.size() - 1; i < j; i++, j--)
{
while(i < j && !isalnum(s[i])) i++;
while(i < j && !isalnum(s[j])) j--;
if(i < j && tolower(s[i]) != tolower(s[j]))
return false;
}
return true;
}
};
本文介绍如何通过编程方法判断一个字符串是否为回文串,即正读和反读都相同的字符串,忽略非字母数字字符和大小写。
1849

被折叠的 条评论
为什么被折叠?



