class Solution {
public int reverse(int x) {
int neg = x < 0 ? -1 : 1;
x *= neg;
int ret = 0;
while (x > 0) {
int n = ret;
n *= 10;
n += x % 10;
x /= 10;
if (n / 10 != ret) return 0;
ret = n;
}
return ret * neg;
}
}
//时间复杂度: O(log(x))
//空间复杂度: O(1)
class Solution { public int reverse(int x) { int neg = x < 0 ? -1 : 1; x *= neg; int ret = 0; while (x > 0) { int n = ret; n *= 10; n += x % 10; x /= 10; if (n / 10 != ret) return 0; ret = n; } return ret * neg; }}//时间复杂度: O(log(x))//空间复杂度: O(1)