首页 > 代码库 > LeetCode Valid Palindrome
LeetCode 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) { if(s.size()==0) return true; char *str=new char [s.size()]; int k=0; for(int i=0;i<s.size();i++){ if(s[i]>='a'&&s[i]<='z') str[k++]=s[i]; } str[k]='\0'; int st=0,ed=k; while(str[st++]==str[ed--]&&str<ed); delete []str; if(st>=ed) return true; else return false; } };
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。