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.
解题思路:
题意为不区分大小写,且只判断数字和字母。有个transform函数学会了:std::transform(s.begin(), s.end(), s.begin(), ::tolower);,能够将字符串转化成小写形式。
class Solution {
public:
bool isPalindrome(string s) {
int len = s.length();
std::transform(s.begin(), s.end(), s.begin(), ::tolower); //这个函数学会
int i=0, j=len-1;
while(i='a'&&c<='z' || c>='0'&&c<='9'){
return true;
}
return false;
}
};
二次刷题(2015-08-05)
class Solution {
public:
bool isPalindrome(string s) {
int i = 0, j = s.length() - 1;
while(i
转载请注明: » [LeetCode] Valid Palindrome
<!--
-->
原文作者:;如有侵权,请联系管理员删除。