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