题目:
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.
Tags Two Pointers String
Similar Problems (E) Palindrome Linked List
分析:
算法流程:
(1)建立两个迭代器,分别指向字符串的头和尾
(2)如果迭代器指向的是非字符字母,则分别向左向右移动迭代器
(3)比较两个迭代器的值,如果不等,则表示非回文,退出循环,否则,继续循环,直到左边的迭代器大于右边的迭代器
注意:
(1)要对其他字符进行处理
(2)设定正确的边界调节(注意string.end指向的是最后一个字符的下一个位置)
代码:
class Solution {
public:
bool isPalindrome(string s) {
int flag = 1;
string::iterator it1 = s.begin();
string::iterator it2 = s.end();
while(it1<it2)
{
if(!isAlphanumeric(*it1))
{
++it1;
continue;
}
else if(!isAlphanumeric(*(it2-1)))
{
--it2;
continue;
}
//判定
int differ = abs(*it1-*(it2-1));
if(differ!=0&&differ!=32)
{
flag = 0;//表示不是回文
break;
}
else
{
++it1;
--it2;
}
}
if(flag==0)
return false;
else
return true;
}
bool isAlphanumeric(char c)
{
if((c<=122&&c>=97)||(c<=90&&c>=65)||(c<=57&&c>=48))
return true;
else
return false;
}
};
结果:
总结:
无