题目:
题解:
class Solution {
public int reverse(int x) {
int rev = 0;
while (x != 0) {
if (rev < Integer.MIN_VALUE / 10 || rev > Integer.MAX_VALUE / 10) {
return 0;
}
int digit = x % 10;
x /= 10;
rev = rev * 10 + digit;
}
return rev;
}
}
标签:10,digit,Java,int,题解,rev,return,Leetcode
From: https://blog.csdn.net/m0_57195758/article/details/137336877