LeetCode 7 — Reverse Integer（C++ Java Python）

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).

考虑负数的处理，逐位反转。

C++实现：

class Solution {
public:
int reverse(int x) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int result = 0;

int flag = 0;
if(x < 0)
{
flag = 1;
x = -x;
}

int lastDigit = 0;
while(x > 0)
{
lastDigit = x - x / 10 * 10;
result = result * 10 + lastDigit;
x /= 10;
}

if(flag == 1)
{
result = - result;
}

return result;
}
};
Java实现：
public class Solution {
public int reverse(int x) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int result = 0;

int flag = 0;
if (x < 0) {
flag = 1;
x = -x;
}

int lastDigit = 0;

while (x > 0) {
lastDigit = x - x / 10 * 10;
result = result * 10 + lastDigit;
x /= 10;
}

if (flag == 1) {
result = -result;
}

return result;
}
}
Python实现：
class Solution:
# @return an integer
def reverse(self, x):
result = 0

flag = 0
if x < 0:
flag = 1
x = -x

while x > 0:
lastDigit = x - x / 10 * 10
result = result * 10 + lastDigit
x /= 10

if flag == 1:
result = -result

return result
感谢阅读，欢迎评论！