首页 > 代码库 > LeetCode Problem 9:Palindrome Number回文数
LeetCode Problem 9:Palindrome Number回文数
描述:Determine whether an integer is a palindrome. Do this without extra space.
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.
注意问题要求O(1)空间复杂度,注意负数不是回文数。
思路1:将输入整数转换成倒序的一个整数,再比较转换前后的两个数是否相等,但是这样需要额外的空间开销
思路2:每次提取头尾两个数,判断它们是否相等,判断后去掉头尾两个数。
1 class Solution { 2 public: 3 bool isPalindrome(int x) { 4 5 //negative number 6 if(x < 0) 7 return false; 8 9 int len = 1;10 while(x / len >= 10)11 len *= 10;12 13 while(x > 0) {14 15 //get the head and tail number16 int left = x / len;17 int right = x % 10;18 19 if(left != right)20 return false;21 else {22 //remove the head and tail number23 x = (x % len) / 10;24 len /= 100;25 }26 }27 28 return true;29 }30 };
LeetCode Problem 9:Palindrome Number回文数
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。