本文探讨如何在不使用额外空间的情况下确定一个整数是否为回文数。考虑到负数可能也是回文数，同时避免将整数转换为字符串。在尝试反转整数时，需要注意反转可能导致溢出的问题，尤其是在解决过“反转整数”问题之后。文章作者采用了反转整数的方法，但了解到存在更通用的解决方案，期待读者分享。
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) {
if (x < 
订阅专栏 解锁全文
224
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
