leetcode 7 REVERSE INTEGER

 Reversedigits of an integer.

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

Haveyou thought about this?

Here are some good questions to askbefore 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 reversedinteger might overflow? Assume the input is a 32-bit integer, then the reverseof 1000000003 overflows. How should you handle such cases?

Throw an exception? Good, but what ifthrowing an exception is not an option? You would then have to re-design thefunction (ie, add an extra parameter).

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