leetcode009 Palindrome Number

题目：

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

click to show spoilers.

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.

思路：

思路1：先算出这个数一共有多少位，然后每次取出高位和低位进行比较，再把高位和低位给截取掉。注意base不能为int，不然可能会溢出

bool isPalindrome(int x) 
{
    if(x<0) return false;
	if(x<10) return true;
	unsigned long long base = 10;
	while((x / base) != 0)
		base *= 10;
	base /= 10;
	while(x != 0)
	{	
		int high = x / base; //取出最高位
		int low = x % 10;  	//取出最低位
		//cout<<"high:"<<high<<" low:"<<low<<" base:"<<base<<endl;
		if(high != low) return false;
		x = (x - high*base) / 10;
		base /= 100;
		//cout<<"x:"<<x<<endl;
	}    
	return true;
}

思路2：如果这个数是回文数，则这个数reverse以后必然和原数相等，因此可以用和第七题reverse number同样的解法

bool isPalindrome(int x) 
{
   if(x < 0) return false;
   int t = x;
   int reverse = 0;
   while(t != 0)
   {
	    int num = t % 10;
	    reverse = reverse*10 + num;
	    t /= 10;
   }     
   return reverse == x;
}