Difficulty: Easy
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
class Solution {
public:
int reverse(int x) {
const int max = INT_MAX; //int最大值
const int min = INT_MIN; //int最小值
long long sum = 0;
while(x){
sum=sum*10+x%10;
if (sum>max || sum<min) //溢出处理
return 0;
x = x / 10;
}
return sum;
}
};