Reverse Integer

最新推荐文章于 2022-09-18 19:57:18 发布

leonordo

最新推荐文章于 2022-09-18 19:57:18 发布

阅读量416

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/guoyilin/article/details/47952635

版权

leetcode 专栏收录该内容

46 篇文章 0 订阅

订阅专栏

Reverse digits of an integer.

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

click to show 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.

Update (2014-11-10):
Test cases had been added to test the overflow behavior.

要特别小心溢出的问题。

#include <limits.h>
class Solution {
public:
    int reverse(int x) {
        int value = 0;
        bool fushu = false;
        if(x < 0){
            value = -x; 
            fushu = true;
        }
        else
            value = x;
        int result = 0;
        while(value)
        {
            int yushu = value % 10;
            value = value / 10;
            //detect overflow.
            if(result > INT_MAX / 10)
                return 0;
            if(result * 10 > INT_MAX - yushu)
                return 0;
            result  = result * 10 + yushu;
        }
        if(fushu)
            result = 0-result;
        return result;
    }
};