题目:Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Test cases had been added to test the overflow behavior.
本题很简单,唯一值得注意的点是反转之后要做溢出检查,有两种方式,一可以每次得到结果都判断,二可以将32位先转成64位,再最后判断是否溢出。
一:
class Solution {
public:
int reverse(int x) {
int result = 0;
while(x!=0){
if(result >INT_MAX/10 ||result
二:
class Solution {
public:
int reverse(int x) {
long long result = 0;
int sign = (x<0)?-1:1;
x = abs(x);
while(x)
{
result = result * 10 + x%10;
x /= 10;
}
result*=sign;
if(result > INT_MAX || result < INT_MIN)
return 0;
else
return result;
}
};