LeetCode之Reverse Integer

最新推荐文章于 2019-07-21 18:23:09 发布

原创最新推荐文章于 2019-07-21 18:23:09 发布 · 820 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

55 篇文章

订阅专栏

本文介绍了一种用于反转整数的简单算法，并通过C++代码实现。该算法考虑了特殊情况，如整数末位为0的情况及32位整数反转后的溢出问题。

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

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

        int sum=0;
        while(x){
            sum=sum*10+x%10;
            x=x/10;
        }
        return sum;
    }
};