题目:https://leetcode.com/problems/reverse-integer/
简介:这道题目没什么特别介绍的,相对容易。
class Solution {
public int reverse(int x) {
long res = 0;
while (x != 0) {
int num = x % 10;
x = x / 10;
res = res * 10 + num;
if (res > Integer.MAX_VALUE || res < Integer.MIN_VALUE) {
return 0;
}
}
return (int) res;
}
}