【leetcode】9. 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.

求一个数字是否是回文数字。

构造一个该数字的回文数字，判断与原数字是否相等。

public boolean isPalindrome(int x){int max = x;int min = 0;while( max > 0){min *= 10;min += max % 10; //每次取max的最低位，组合的新数字*10max /= 10;}return min == x;}