题目:
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
Example 1:
Input: 121
Output: true
Example 2:
Input: -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
Example 3:
Input: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
分析:这题比较简单,负数时就是false,个位数一定位ture,然后向中间缩小判断,这部分请看代码
代码:
class Solution {
public:
bool isPalindrome(int x) {
int n = 1 ; //代表x整除10^n后结果位个位数,用来取x的最高位数值
if(x < 0) return false ;
if(x < 10) return true ;
while(x / pow(10,n) >= 10)
n ++ ;
for( ; n > 0; n -=2){ //每次减少两位,取最高位时用除法操作
if(x % 10 == int(x / pow(10 , n))){
x %= int(pow(10,n)) ; //去掉最高位
x /= 10 ; //去掉最低位
}
else
return false ;
}
return true ;
}
};