Reverse Integer（整数逆转）

整数翻转算法

最新推荐文章于 2025-01-19 11:00:53 发布

原创最新推荐文章于 2025-01-19 11:00:53 发布 · 540 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #algorithm #整数倒置

LeetCode OJ 专栏收录该内容

71 篇文章

订阅专栏

本文介绍了一种整数翻转的算法实现，并通过一个具体的示例进行说明。该算法能够处理正负整数的翻转操作，同时也讨论了在特定情况下（如输入整数的最后一位为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?

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

其实题目中的提示没有什么作用只是告诉你可能的出现的bug 但是在测试的用例中，如果出现了1000000003 程序输出错了也没事。

class Solution {
public:
    int reverse(int x) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        int res = 0;
        while (x)
        {
            res = res * 10 + x % 10;
            x /= 10;
        }
        return res;
    }
};