首页 > 代码库 > Valid Palindrome
Valid Palindrome
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.
思路:使用string中erase函数剔除非数字、字母,在判定是否符合条件
注意++i的位置,erase(i,1)后,应继续从i位置检查,而不应该++i;
erase()函数用法
code:
class Solution {public: bool isPalindrome(string s) { for(int i=0;i<s.size();) { if(!(s[i]>=‘a‘&&s[i]<=‘z‘||s[i]>=‘0‘&&s[i]<=‘9‘)) s.erase(i,1); else ++i; } for(int i=0,j=s.size()-1;(i<s.size()-1)&&(j>=0);++i,--j) { if(!(s[i]==s[j]||abs(s[i]-s[j])==32)) return false; } return true; }};
Valid Palindrome
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。