Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
刚开始做的时候没注意数据溢出,后来看了一下大佬的博客,用long存一下,过了。
public class Solution {
public int reverse(int x) {
long t = x ;
long r=0;
while(t!=0){
r = r*10 + t % 10;
t/=10;
}
if(r > Integer.MAX_VALUE||r < Integer.MIN_VALUE){
r=0;
}
return (int)r;
}
}