leetcode_7_Reverse Integer

最新推荐文章于 2020-06-08 21:57:59 发布

mnmlist_tata

最新推荐文章于 2020-06-08 21:57:59 发布

阅读量918

点赞数 1

分类专栏： leetcode leetcode题解文章标签： Reverse Integer 数组

本文链接：https://blog.csdn.net/mnmlist/article/details/43225537

版权

leetcode 同时被 2 个专栏收录

160 篇文章 0 订阅

订阅专栏

leetcode题解

141 篇文章 4 订阅

订阅专栏

描述:

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.

思路：

思路倒是简洁明了，将整数的非符号部分的各位存储到一个数组里面，然后将各位组装起来就成为一个新的整数。当然，溢出，符号都是需要考虑的。

代码：

int reverse(int x) {
        int i=0;
        int num[20]={0};
        long sum=0;
        int flag=0;
        if(x<0)
            {x=-x;flag=1;}
        while(x!=0)
        {
            num[i++]=x%10;
            x/=10;
        }
        for(int j=0;j<i;j++)
        {
            sum=sum*10+num[j];
        }
        if(flag)
        sum=-sum;
        return sum;
        
    }