首页 > 代码库 > 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.
class Solution {public: bool isPalindrome(string s) { int len = s.length(), ind = 0; if(len==0) return true; len--; while(ind<len){ while(!isValid(s[ind])&&ind<len){ind++;} while(!isValid(s[len])&&ind<len){len--;} if(!(s[ind]==s[len] || abs(s[ind]-s[len])==32)) return false; ind++; len--; } return true; } bool isValid(char c){ if(c>=‘0‘&&c<=‘9‘) return true; if(c>=‘a‘&&c<=‘z‘) return true; if(c>=‘A‘&&c<=‘Z‘) return true; return false; }};
Valid Palindrome
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。