题目描述:
Determine whether aninteger is a palindrome. Do this without extra space.
Some hints:
Could negativeintegers be palindromes? (ie, -1)
If you are thinkingof converting the integer to string, note the restriction of using extra space.
You could also tryreversing an integer. However, if you have solved the problem "Reverse Integer", you know that the reversed integer might overflow.
题目理解:
判断一个整型是不是回文数。
回文数:设n是一任意自然数。若将n的各位数字反向排列所得自然数n1与n相等,则称n为一回文数。例如,若n=1234321,则称n为一回文数;但若n=1234567,则n不是回文数。
题目分析:
1. 题目要求只能用O(1)的空间,所以不能考虑把它转化为字符串然后reverse比较的方法。
2. 在提示中也提到了,如果考虑reverse number的方法,可能造成溢出。
3. 那么只能选择分离数字的方法,当然要用到大量除10和取余数的计算。
题目解答:
static public boolean inPalindrome(int x){ int original = x; long reverse = 0; int digit = 0; while(x != 0){ digit = x % 10; reverse = reverse * 10 + digit; x /= 10; } return(reverse == original); }