Leetcode9. Palindromes

#include <iostream>
#include <string>
#define _DEBUG

class Solution {
public:
    bool isPalindrome(int x) 
    {
        std::string strX = int2Str(x);
        return strIsPalindrome(strX);
    }
    //  Integer to character to 
    std::string int2Str(int x)
    {
        return std::to_string(x);
    }
    //  Determine whether the string is a palindrome 
    bool strIsPalindrome(const std::string& str)
    {
        int begin = 0;
        int end = str.length() - 1;
        while (begin < end)
        {
            if (str[begin] == str[end])
            {
                begin++;
                end--;
            }
            else
            {
                return false;
            }
        }
        return true;
    }
};

int main_leetcode9()
{
    Solution solution;
#ifdef DEBUG
    // int2Str The interface test 
    std::cout << solution.int2Str(123) << std::endl;
    std::cout << solution.int2Str(-123) << std::endl;

    // strIsPalindrome  The interface test 
    std::cout << solution.strIsPalindrome("12321") << std::endl;
    std::cout << solution.strIsPalindrome("-123") << std::endl;

#endif // DEBUG
    std::cout << solution.isPalindrome(12321) << std::endl;
    std::cout << solution.isPalindrome(-123) << std::endl;

    return false;
}