Problem 7.Reverse digits of an integer.

最新推荐文章于 2024-09-13 18:11:35 发布

lzh6920390

最新推荐文章于 2024-09-13 18:11:35 发布

阅读量360

点赞数

分类专栏： leetcode与算法文章标签： leetcode

本文链接：https://blog.csdn.net/lzh6920390/article/details/46625443

版权

leetcode与算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Problem 7.Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321。 —— [leetcode Problem 7 ]

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.

此题需要注意越界的情况，int类型大多数编译器中为32位，最高位是符号位，剩下31位表示数值，可用0x7fffffff表示最大值，更好的方式使用limits.h中的INT_MAX。如果使用unsigned int 定义res,也会出现溢出，因为unsigned int 范围最大为0xffffffff=4294967295，会出现Input: 1534236469 Output: 1056389759 Expected: 0的不正确结果

class Solution {
public:
    int reverse(int x) {
        bool sign=true;
        if(x<0)
            sign=false,x=-x;
        unsigned long long res=0;
        while(x){
            res=res*10+x%10;
            x=x/10;
        }
        if(res>INT_MAX)
            return 0;
        if(sign)
            return res;
        else
            return (int)-res;
    }
};