public int reverse(int x) {
if (x >= -9 && x <= 9) {
return x;
}
long n = 0;
while (x != 0) {
n = n*10 + x%10;
x = x/10;
}
return (int)n == n ? (int)n : 0;
}
【咸鱼刷LeetCode-7】 整数反转(简单)
最新推荐文章于 2023-10-06 10:52:45 发布
public int reverse(int x) {
if (x >= -9 && x <= 9) {
return x;
}
long n = 0;
while (x != 0) {
n = n*10 + x%10;
x = x/10;
}
return (int)n == n ? (int)n : 0;
}