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: [−2^31, 2^31 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
这道题是看似十分简单,其实就是很简单。但是里面有个坑,int最大只能接受[−2^31, 2^31 − 1],也就是说最大值为2147483647,如果int x = 1534236469; 反转后8463847412 已经超过了最大值。 再用int接受就报错了。
class Solution {
public int reverse(int x) {
int result =0;
while(x != 0)
{
result = (result*10) + (x%10);
if(result > Integer.MAX_VALUE){
return 0;
}
if(result < Integer.MIN_VALUE){
return 0;
}
x = x/10;
}
return (int)result;
}
}