Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!
If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.
Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?
Throw an exception? Good, but what if throwing an exception is not an option? You would then have to re-design the function (ie, add an extra parameter).
其实这道题本身可能不是太难,但是如果是想设计一种General的Solution的话就不是那么容易的了,得再考虑大数等一系列东西。
class Solution {
public:
int reverse(int x) {
bool flag = 0;
int res = 0;
int temp = 0;
if (x < 0)
{
flag = 1;
x = -x;
}
while ( x > 0)
{
temp = x % 10;
x = x / 10;
res = res * 10 + temp;
}
if (flag)
{
return -res;
}
return res;
}
};