LeetCode 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.

• 字符串题。两种解法，一种是直接把string翻转比较，另一种是传统的首尾两个指针移动比较。
• 注意对指针-- end，end不能为size_t类型, 否则一旦被减为-1则会被转变为INT_MAX，程序进入死循环。
• 学习了string相关STL算法和函数，往string里添加char用push_back。
• toupper - C++ Reference
  • 　　http://www.cplusplus.com/reference/cctype/toupper/
• isalnum - C++ Reference
  • 　　http://www.cplusplus.com/reference/cctype/isalnum/?kw=isalnum
• transform - C++ Reference
  • 　　http://www.cplusplus.com/reference/algorithm/transform/?kw=transform
• string::push_back - C++ Reference
  • 　　http://www.cplusplus.com/reference/string/string/push_back/
• reverse_copy - C++ Reference
  • 　　http://www.cplusplus.com/reference/algorithm/reverse_copy/
• reverse_copy
  • 　　https://msdn.microsoft.com/zh-cn/library/c7ty5c36.aspx

#include <iostream>
#include <string>
#include <cctype>  // toupper, isalnum
#include <algorithm>  // transform
using namespace std;

class Solution {
public:
    bool isPalindrome(string s) 
    {
         string sTemp = "", sReverse = "";

         // Convert characters to UPPER
         transform(s.begin(), s.end(), s.begin(), ::toupper);

         // considering only alphanumeric characters
         for (int i = 0; i < s.length(); i ++)
             if (isalnum(s.at(i)))
                sTemp.push_back(s.at(i)); // Appends character to the end of the string, increasing its length by one.

         // Need to allocate space if use reverse_copy
         sReverse.resize(sTemp.length());
         reverse_copy(sTemp.begin(), sTemp.end(), sReverse.begin());
/*
         sReverse = sTemp;
         reverse(sReverse.begin(), sReverse.end());
*/         
/*
         cout << sTemp << endl;
         cout << sReverse << endl;
*/         
         return sTemp == sReverse;
    }
    
    bool isPalindrome2(string s) 
    {
         int start = 0, end = s.length() - 1;

         while (start < end)
         {
               if ( !isalnum(s.at(start)) ) 
                  start ++;
               else if ( !isalnum(s.at(end)) ) 
                    end --;
               else if (toupper(s.at(start)) != toupper(s.at(end))) // Remember toupper 
                      return false;
               else
               {
                   // Remember to move ptr
                   start ++;
                   end --;
               }
         }
         
         return true;
    }
    
};

int main ()
{
    Solution testSolution;
    string sTest[] = {"A man, a plan, a canal: Panama", "race a car"};
    
    for (int i = 0; i < 2; i ++)
        cout << testSolution.isPalindrome(sTest[i]) << endl;
    
    getchar();
    
    return 0;
}