和大神们学习每天一题(leetcode)-Palindrome Number

Determine whether an integer is a palindrome. Do this without extra space.

Some hints:

Could negative integers be palindromes? (ie, -1)

If you are thinking of converting the integer to string, note the restriction of using extra space.

You could also try reversing an integer. However, if you have solved the problem "Reverse Integer", you know that the reversed integer might overflow. How would you handle such case?

There is a more generic way of solving this problem.

#include<iostream>
using std::cout;
using std::endl;

class Solution 
{
public:
	bool isPalindrome(int x) 
	{
		int nAbsNum, nReverNum;
		if (x < 0)
		{
			return false;
		}
		nAbsNum = x;
		nReverNum = 0;
		while (nAbsNum != 0)
		{
			if (nReverNum > 214748364)
			{
				return false;
			}
			nReverNum = nReverNum * 10 + nAbsNum % 10;
			nAbsNum = nAbsNum / 10;
		}
		if (nReverNum != x)
		{
			return false;
		}
		return true;
	}
};
int main()
{
	int nNum = -2147447412;
	Solution SoFunction;
	bool bResult;
	bResult = SoFunction.isPalindrome(nNum);
	if (bResult)
	{
		cout << "the number is palindrome!" << endl;
	}
	else
	{
		cout << "the number is not palindrome!" << endl;
	}

	system("pause");
}