【LeetCode】Reverse Integer

题目描述：

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

Have you thought about this?

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

题目没啥好说的。关于后面的几个问题，我想还是应该在不同的实际环境中分别处理吧。可以返回exception，可以返回0，也可以用个long来作为返回值。

代码如下：

class Solution {public:int reverse(int x) {int res(0);while (x){res = res * 10 + x % 10;x = x / 10;}return res;}};