英文题目:
Determine whether an integer is a palindrome. Do this without extra space.
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)
如果你打算把整数转为字符串,请注意不允许使用辅助空间的限制。
你也可以考虑将数字颠倒。但是如果你已经解决了 “颠倒整数” 问题的话,就会注意到颠倒整数时可能会发生溢出。你怎么来解决这个问题呢?
本题有一种比较通用的解决方式。
代码一(203ms)
class Solution {
public boolean isPalindrome(int x) {
if(x<0||x!=0&&x%10==0) return false;
int num=0;
int f=x;
while(f!=0){
num+=f%10;
f/=10;
if(f!=0) num*=10;
}
if(x==num){
return true;
}else{
return false;
}
}
}
代码二(168ms)简化版:
class Solution {
public boolean isPalindrome(int x) {
if(x<0||x!=0&&x%10==0) return false;
int num=0;
int f=x;
while(f!=0){
num=num*10+f%10;
f/=10;
}
return x==num;
}
}