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