[leetcode] 125.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.
题意：
判断一个字符串是否是回文的，只考虑里面的字符跟数字，并且不考虑字符的大小写问题。
思路：
我们使用isalnum函数来判断一个字符是不是数字或者字符。使用两个指针，指向开头和结尾。如果不是字符或者数字那么移动着两个指针，否则比较它们是否相等。比较是否相等的时候需要忽略大小写，这个需要注意下。

class Solution {
public:
    bool isPalindrome(string s) {
        if (s.empty())return true;
        int first = 0;
        int size = s.length();
        int second = size - 1;
        while (first < second) {
            while (first < second && !isalnum(s[first]))first++;
            while (first < second && !isalnum(s[second]))second--;
            if (first >= second)break;
            if (!equalAlpha(s[first], s[second]))return false;
            first++;
            second--;
        }
        return true;
    }

    bool equalAlpha(char a, char b) {
        a = (a >= 'A') ? tolower(a) : a;
        b = (b >= 'A') ? tolower(b) : b;
        return a == b;
    }
};