class Solution {
public int reverse(int x) {
int vel = 0;
while(x != 0){
int pop = x % 10;
if(Integer.MAX_VALUE/10 < vel || (Integer.MAX_VALUE/10 == vel && pop > 7)) return 0;
if(Integer.MIN_VALUE/10 > vel || (Integer.MIN_VALUE/10 == vel && pop < -8)) return 0;
x /= 10;
vel = vel*10 + pop;
}
return vel;
}
}
整数反转
最新推荐文章于 2023-03-16 17:33:33 发布