首页 > 代码库 > 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.
思路很简单，只要把这个数字逆序就行了 123--》321 ，如果回文，必然相等
翻了翻自己以前写的逆序代码，有点sb，不过思想是对的，代码简洁性有待提高啊
1 public boolean isPalindrome(int x) { 2 //caculate the reverse of an integer 123 --> 321 3 int reverse = 0; 4 int temp = x; 5 if(x < 0){ 6 return false; 7 } 8 while(temp > 0){ 9 reverse = reverse * 10 + temp%10;10 temp = temp / 10;11 }12 return reverse == x;13 }
Leetcode-Palindrome Number
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。