leetcode【125】Valid Palindrome【c++，时间82%，空间100%】

问题描述：

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.

Note: For the purpose of this problem, we define empty string as valid palindrome.

Example 1:

Input: "A man, a plan, a canal: Panama"
Output: true

Example 2:

Input: "race a car"
Output: false

源码：

就一句话，注意边界。时间很垃圾27%，空间100%。

class Solution {
public:
    bool isPalindrome(string s) {
        if(s.length() == 0)     return true;
        int left = 0, right = s.length()-1;
        while(left<right){
            while(!(s[left]>='a' && s[left]<='z') && !(s[left]>='A' && s[left]<='Z') && !(s[left]>='0' && s[left]<='9') && left<right)      left++;
            if(s[left]>='A' && s[left]<='Z')   s[left] = s[left] + ('a'-'A');
            while(!(s[right]>='a' && s[right]<='z') && !(s[right]>='A' && s[right]<='Z') && !(s[right]>='0' && s[right]<='9') && left<right)      right--;
            if(s[right]>='A' && s[right]<='Z')   s[right] = s[right] + ('a'-'A');
            if(s[right] == s[left]){
                // cout<<s[left]<<" "<<s[right]<<endl;
                right--;    left++;
            }
            else    return false;
        }
        return true;
    }
};

后来发现了是由库函数能解决判断的问题的，不用写的那么冗余。可以创建两个string这样比较，少了一些判断步骤。虽然不大好。时间82%，空间100%。

 

class Solution {
public:
    bool isPalindrome(std::string s){
        string res1;
        string res2;
        for(auto &el: s){
            if(isalnum(el)){
                res1.push_back(el = tolower(el));
            }
        }
        res2 = res1;
        reverse(res2.begin(), res2.end());
        return res1 == res2;
    }
};