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.

代码：

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

bool isPalindrome(string s)
{
    transform(s.begin(),s.end(),s.begin(),::tolower);
    auto left = s.begin(), right = prev(s.end());

    while (left < right)
    {
        if(!isalnum(*left)) ++left;
        else if (!isalnum(*right)) --right;
        else if (*left != *right) return false;
        else
        {
            left++;
            right--;
        }
    }

    return true;
}


int main()
{
    string s1 = "A man, a plan, a canal: Panama";
    string s2 = "race a car";
    string s3 = "";

    if (isPalindrome(s1))
    {
        cout<<"s1 is Palindrome"<<endl;
    }
    else
    {
        cout<<"s1 is not Palindrome"<<endl;
    }

    if (isPalindrome(s2))
    {
        cout<<"s2 is Palindrome"<<endl;
    }
    else
    {
        cout<<"s2 is not Palindrome"<<endl;
    }

    if (isPalindrome(s3))
    {
        cout<<"s3 is Palindrome"<<endl;
    }
    else
    {
        cout<<"s3 is not Palindrome"<<endl;
    }

    return 0;
}