//#7 Reverse Integer
//8ms 100%
class Solution {
public:
int reverse(int x)
{
if(x == -2147483648) return 0;
bool positive(true);
if(x < 0)
{
positive = false;
x = abs(x);
}
int result(0);
while(x != 0)
{
if(result >= 214748365 || (result == 214748364 && x >= 8))
{
//cout << "result: " << result << ", x%10: " << x%10 << " overflow\n";
return 0;
}
result = result*10 + x%10;
x = x / 10;
}
if(!positive) result = result * -1;
return result;
}
};
[Leetcode]#7 Reverse Integer
最新推荐文章于 2024-10-13 15:10:00 发布