首页 > 代码库 > 【Leetcode】Palindrome Number
【Leetcode】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.
方法一：先将数字反转，比较反转前后是否相等。但这种方法反转时可能发生溢出。
1 class Solution { 2 public: 3 bool isPalindrome(int x) { 4 if (x < 0) { 5 return false; 6 } 7 return x == reverse(x); 8 } 9 private:10 int reverse(int x) {11 unsigned ret = 0;12 while (x) {13 ret = ret * 10 + x % 10;14 x /= 10;15 }16 return ret;17 } 18 };
方法二：逐位比较。
1 class Solution { 2 public: 3 bool isPalindrome(int x) { 4 if (x < 0) { 5 return false; 6 } 7 int d = 1; 8 while (x / d >= 10) { 9 d *= 10;10 }11 12 while (x > 0) {13 if (x / d != x % 10) {14 return false;15 }16 x = x % d / 10;17 d = d / 100;18 }19 return true;20 }21 };
【Leetcode】Palindrome Number
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。