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