class Solution {
public int reverse(int x) {
long result = 0;
for(; x != 0; x /= 10) {
result = result * 10 + x % 10;
}
if (result > Integer.MAX_VALUE || (result < Integer.MIN_VALUE)) {
return 0;
} else {
return (int) result;
}
// long res = 0;
// for (; x != 0; x /= 10)
// res = res * 10 + x % 10;
// return res > Integer.MAX_VALUE || res < Integer.MIN_VALUE ? 0 : (int) res;
}
}
LeetCode - 07: Reverse Integer
最新推荐文章于 2024-07-25 11:15:54 发布