7. Reverse Integer

最新推荐文章于 2021-02-07 17:28:23 发布

zg1g

最新推荐文章于 2021-02-07 17:28:23 发布

阅读量1k

点赞数 2

分类专栏：算法/LeetCode 经典算法，LeetCode题目研究文章标签： leetcode Math

本文链接：https://blog.csdn.net/daigualu/article/details/72464418

版权

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章 18 订阅

订阅专栏

算法/LeetCode

223 篇文章 1 订阅

订阅专栏

原题

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

click to show spoilers.

Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.

代码实现

     public int Reverse(int x) 
        {
            bool isNegative = x < 0;
            long rtn = 0;
            while (x != 0)
            {
                int postBit = x%10;
                long iterval = rtn*10 + postBit;
                if (isNegative && iterval < -2147483648) return 0;
                if (iterval > 2147483647) return 0;
                rtn = iterval;
                x /= 10;
            }
            return (int)rtn;
        }

一种不适用最大值和最小值的判断溢出方法：

        public static int Reverse(int x)
        {
            int rtn = 0;

            while (x != 0)
            {
                int postBit = x % 10;
                //if happens overflow, rtn!= (iterval - postBit)/10
                int iterval = rtn * 10 + postBit; 
                if ((iterval - postBit) / 10 != rtn) //solve the overflow
                {
                    return 0;
                }
                rtn = iterval;
                x = x / 10;
            }
            return rtn;
        }