大家好，又见面了，我是全栈君。
125 Valid Palindrome
链接：https://leetcode.com/problems/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.
Hide Tags Two Pointers String
Hide Similar Problems (E) Palindrome Linked List
求一个字符串是不是回文字符串。仅仅关注字母和数字。而且忽略字母的大写和小写。
class Solution {
public:
bool isPalindrome(string s) {
string str="",rstr;
for(int i=0;i<s.size();i++)
{
if((s[i]>47&&s[i]<58)||(s[i]>64&&s[i]<91))
str+=s[i];
else if(s[i]>96&&s[i]<123)
str+=s[i]-32;
}
rstr=str;
reverse(str.begin(),str.end());
return rstr==str;
}
};
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请联系我们举报，一经查实，本站将立刻删除。
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/115365.html原文链接：https://javaforall.net
![高并发解决方案-代理服务器Nginx[通俗易懂]](https://javaforall.net/wp-content/uploads/2020/11/2020110817443450-480x300.jpg)
