记录点滴

用代码窥探数字世界 Hello World

7. Reverse Integer 一个简单但是非常考察思维全面性的题目。

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.

class Solution {
public:
    int reverse(int x) {
        int ans = 0; 
        int temp;
        while(x){
            temp = ans * 10 + x % 10;
            if(temp / 10 != ans) return 0;//如果temp overflow,return 0
            ans = temp;
            x /= 10;
        }
        return ans;
    }
};


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/djgjmtdmjt/article/details/54014855
文章标签: math
个人分类: shua
上一篇6. ZigZag Conversion
下一篇8. String to Integer (atoi) 对于输入情况的考察
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭