Question:
Given a 32-bit signed integer, reverse digits of an integer.
Example 1:
Input: 123 Output: 321
Example 2:
Input: -123 Output: -321
Example 3:
Input: 120 Output: 21
Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
分析
反转整数有正负之分,将符号保留,统一先处理正数部分,最后返回时加上符号即可。将整数反转,先将个位提取放在首位,再将十位提取放在第二位。。依次进行,直至完全反转,主要用到整处"/"和求余"%"运算。由于整数有范围限制,反转之后可能超出范围,所以在返回结果之前判断是否超出范围。
class Solution {
public:
int reverse(int x) {
int sign = 1;
if(x < 0)
{
sign = -1;
x = -x;
}
double y = x % 10;
while(x/10 != 0)
{
x /= 10;
y = y*10 + x%10;
}
if(sign*y-pow(2,31)+1 > 0)
return 0;
else if(sign*y+pow(2,31) < 0)
return 0;
else
return int(sign*y);
}
};