题目:
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
目前为止做过最简单的一个leetcode题目,解法如下:
class Solution {
public:
int reverse(int x) {
long long sum = 0, temp;
int maxint = 0x7fffffff;
int minint = 0x80000000;
if (x >= maxint && x <= minint)
return 0;
else
{
while (x != 0)
{
temp = x % 10;
sum = sum * 10 + temp;
sum = sum > maxint ? 0 : sum;
sum = sum < minint ? 0 : sum;
x = x / 10;
}
}
return sum;
}
};