首页 > 代码库 > [leetcode]Palindrome Number
[leetcode]Palindrome Number
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.
算法思路:
重点是求出该整数的位数!
1 public class Solution { 2 public boolean isPalindrome(int x) { 3 if(x < 0) return false; 4 int n = x; 5 int length = 1; 6 while((n = n / 10) != 0) length++; 7 while(length > 1){ 8 int begin = x / pow(length); 9 int end = x % 10;10 if(begin != end) return false;11 x = (x - begin * pow(length)) / 10;12 length -= 2;13 }14 return true;15 }16 private int pow(int n){17 int result = 1;18 for(int i = 1; i < n; result *= 10,i++);19 return result;20 }21 }
不过这道题在leetcode上有专题讲解,我不该班门弄斧的。时间复杂度O(length),空间O(1)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。