原题目:https://leetcode-cn.com/problems/reverse-integer/
思路:
每次把x的余数加到后面,注意判断溢出情况
假设rev为整数,如果rev2 = rev1*10+x%10溢出,那么rev1 >= int_max/10
1、rev1>int_max/10,一定会溢出
2、rev1==inr_max/10,那么只要x%10>int_max%10,就会溢出
代码:
class Solution {
public:
int reverse(int x) {
int rev = 0;
while (x != 0) {
int pop = x % 10;
x /= 10;
if (rev > INT_MAX/10 || (rev == INT_MAX / 10 && pop > INT_MAX%10)) return 0;
if (rev < INT_MIN/10 || (rev == INT_MIN / 10 && pop < INT_MIN%10)) return 0;
rev = rev * 10 + pop;
}
return rev;
}
};