Nicksxs's Blog

What hurts more, the pain of hard work or the pain of regret?

0%

# Reverse Integer

发表于 2015-03-13 分类于 leetcode 阅读次数： 阅读次数： Disqus：

### Reverse Integer

#### Reverse digits of an integer.

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

#### spoilers

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?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

### code

    class Solution {
    public:
        int reverse(int x) {

            int max = 1 << 31 - 1;
            int ret = 0;
            max = (max - 1) * 2 + 1;
            int min = 1 << 31;
            if(x < 0)
                while(x != 0){
                    if(ret < (min - x % 10) / 10)
                        return 0;
                    ret = ret * 10 + x % 10;
                    x = x / 10;
                }
            else
                while(x != 0){
                   if(ret > (max -x % 10) / 10)
                        return 0;
                    ret = ret * 10 + x % 10;
                    x = x / 10;
                }
            return ret;
        }
    };