Determine whether an integer is a palindrome. Do this without extra space.
思路:就是用 "Reverse Integer" 的解法來判斷就行了
class Solution {
public:
bool isPalindrome(int x) {
if( x < 0) return false;
return x == reverse(x);
}
int reverse(int x) {
long newNum = 0;
long tmp = 0;
while(x != 0) {
tmp = newNum*10;
newNum = (long)( tmp + x%10);
if(newNum != (int)(tmp + x%10)) {
return 0;
}
x = x/10;
}
return (int)newNum;
}
};