首页 > 代码库 > 回文题
回文题
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.
需要注意点:
1)empty string问题(不能用while(!chacter[left]) left++)而要用if(!chacter[left]){left++ continue}
2)大小写字母的转换,注意0~9系统是认识的。
class Solution {
public:bool isCharacter(char c)
{
if((c >= ‘a‘&&c <= ‘z‘)||(c >= ‘A‘ && c <= ‘Z‘)||(c >= ‘0‘&&c <= ‘9‘))
return true;
else
return false;
}
char Turntosmallalpha(char c)
{
if(c >= ‘A‘&&c <= ‘Z‘)
c = c + ‘a‘ - ‘A‘;
return c;
}
bool isPalindrome(string s) {
int left = 0;
int right = s.size() - 1;
bool flg = true;
while(left <= right)
{
if(!isCharacter(s[left]))
{
left ++;
continue;
}
if(!isCharacter(s[right]))
{
right --;
continue;
}
if(Turntosmallalpha(s[left]) != Turntosmallalpha(s[right]))
{
flg = false;
break;
}
left ++;
right --;
}
return flg;
}
};
回文题
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。