Palindrome Number （判定一个整数是否是回文）

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.

基本思路：

给定一个头尾指针，比较头尾的值是否相等即可。

	public boolean isPalindrome(int x)
	{
		if(x<0)
			return false;
		int div = 1;
		//得到最大的除数
		while(x/10>=div)
		{
			div*=10;
		}
		while(x>=10)
		{
			int end = x%10;
			int begin = x/div;
			
			if(end!=begin)
				return false;
			
			x = (x%div)/10;
			div/=100;
		}
		return true;
	}