Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
Note: For the purpose of this problem, we define empty string as valid palindrome.
Example 1:
Input: "A man, a plan, a canal: Panama" Output: true
Example 2:
Input: "race a car" Output: false
class Solution {
public:
bool isPalindrome(string s) {
for(int i=0,j=s.size()-1;i<j;i++,j--){
while(isalnum(s[i])==false&&i<j) i++;
while(isalnum(s[j])==false&&i<j) j--;
if(toupper(s[i])!=toupper(s[j])) return false;
}
return true;
}
};
C++两个常用函数isalnum判断char是否为数字或者字母,是的话返回true。
toupper将小写字母转换为大写字母。