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

Subscribe to see which companies asked this question

题意：回文数。判断一个数是否为回文数。回文数就是倒着写一遍跟原数相同的数，即关于中间对称的数。

思路：1.将数逆至，然后比较是否和原数相等，期间需注意逆至的数是否溢出。2.先确定数的位数，然后从两端往中间逐位相比。

class Solution {
public:
	bool isPalindrome(int x) {
		if (x < 0)
			return false;
		int base = 1;
		int tmp = x;
		while (tmp>=10){
			tmp /= 10;
			base *= 10;
		}

		while (x){
			int left = x / base;
			int right = x % 10;
			if (left != right){
				return false;
			}
			x %= base;
			x /= 10;
			base /= 100;
		}
		
		return true;
	}
};