LeetCode 第 125 题 (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) {
string::const_iterator head = s.cbegin();
string::const_iterator tail = s.cend();
while(head < tail)
{
if(!isalnum(*head))
{
head ++;
continue;
}
if(!isalnum(*tail))
{
tail --;
continue;
}
if( tolower(*head) != tolower(*tail) )
{
return false;
}
head ++;
tail --;
}
return true;
}
};
如果不习惯用 iterator,还可以写成 C 风格的。
class Solution {
public:
bool isPalindrome(string s)
{
int n1 = 0, n2 = s.length() - 1;
while(n1 < n2)
{
if(!isalnum(s[n1]))
{
n1 ++;
continue;
}
if(!isalnum(s[n2]))
{
n2 --;
continue;
}
if( tolower(s[n2]) != tolower(s[n1]) )
{
return false;
}
n1 ++;
n2 --;
}
return true;
}
};