首页 > 代码库 > [Leetcode] Palindrome Number
[Leetcode] Palindrome Number
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.
Solution:
题意判断数字是否是回文串，只能用常数空间，不能转换成字符串，不能反转数字。
先计算数字的位数，分别通过除法和取余，提取出要对比的对应数字。
1 public class Solution { 2 public boolean isPalindrome(int x) { 3 if(x<0) 4 return false; 5 if(x==0) 6 return true; 7 int base=1; 8 while(x/base>=10) 9 base*=10;10 while(x>0){11 int first=x/base; //left digit12 int last=x%10; //right digit13 if(first!=last)14 return false;15 x=(x-first*base)/10; //get number between first and last 16 base/=100;17 }18 return true;19 }20 }
[Leetcode] Palindrome Number
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。