算法设计与应用基础系列8
2017-06-14 13:47
344 查看
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.
代码如下,为如何判断一个整数为回文
public boolean isPalindrome(int
x)
{ if (x<0
|| (x!=0
&& x%10==0))
return false;
int rev = 0;
while (x>rev){
rev = rev*10
+ x%10;
x
= x/10;
} return (x==rev
|| x==rev/10);}
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.
代码如下,为如何判断一个整数为回文
public boolean isPalindrome(int
x)
{ if (x<0
|| (x!=0
&& x%10==0))
return false;
int rev = 0;
while (x>rev){
rev = rev*10
+ x%10;
x
= x/10;
} return (x==rev
|| x==rev/10);}