【leetcode】Palindrome Number
Question：
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.
Anwser 1：
class Solution {
public:
bool isPalindrome(int x) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(x < 0) return false;
int div = 1;
while(x/10 >= div){ // get large division
div *= 10;
}
while(x > 9){
int high = x / div; // left digit
int low = x % 10; // right digit
if(high != low){
return false;
}
x = (x % div) / 10; // get number between first and last
div /= 100;
}
return true;
}
};Anwser 2：
class Solution {
public:
bool check(int x, int &y) {
if (x == 0) return true;
if (check(x/10, y) && (x%10 == y%10)) {
y /= 10;
return true;
} else {
return false;
}
}
bool isPalindrome(int x) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(x < 0) return false;
return check(x, x);
}
};参考推荐：
本文参与 腾讯云自媒体分享计划，分享自作者个人站点/博客。
原始发表：2013年04月14日，如有侵权请联系 cloudcommunity@tencent.com 删除
评论
登录后参与评论
推荐阅读