注意溢出时的处理,坑爹的LeetCode,居然返回0,不应该是-1吗??
public class Solution {
public int reverse(int x) {
long res = 0;
while (x != 0) {
res = res * 10 + x % 10;
x /= 10;
}
if(res > Integer.MAX_VALUE || res < Integer.MIN_VALUE){
return 0;
}
return (int) res;
}
}