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