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.
代码:
int reverse(int x) {
int Max=0x7fffffff;
int Min=0x80000000;
long b=0;
while(x!=0)
{
b=x%10+b*10;
x=x/10;
}
if(b>Max||b<Min)
return 0;
else
return b;
}