125 Valid Palindrome

大家好，又见面了，我是全栈君。

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.cn/115365.html原文链接：https://javaforall.cn