您的位置:首页 > 其它

LeetCode Palindrome Number

2014-08-27 21:54 267 查看
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.
class Solution {
public:
bool isPalindrome(int x) {
int num = abs(x);
int rev = 0;
while (x) {
int d = x % 10;
x /= 10;
rev = rev * 10 + d;
}

if (rev == num)
return true;
else
return false;
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  leetcode 回文