leetcode刷题之旅（7）Reverse Integer

最新推荐文章于 2020-08-06 10:31:45 发布

sun10081

最新推荐文章于 2020-08-06 10:31:45 发布

阅读量88

点赞数

分类专栏：刷题之LeetCode

本文链接：https://blog.csdn.net/sun10081/article/details/80231080

版权

刷题之LeetCode 专栏收录该内容

44 篇文章 0 订阅

订阅专栏

题目描述

Given a 32-bit signed integer, reverse digits of an integer.

样例

Example 1:

Input: 123
Output: 321

Example 2:

Input: -123
Output: -321

Example 3:

Input: 120
Output: 21

Note:

Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

思路分析

和leetcode9题相似，通过 rev*10+x%10将数字倒序。之所以定义rev为long而不是int，考虑到大数的情况，超过int上线，返回0，最后再将rev强转回int即可。

代码

class Solution {
    public int reverse(int x) {
        long rev= 0;
        while( x != 0){
            rev= rev*10 + x % 10;
            x= x/10;
            if( rev > Integer.MAX_VALUE || rev < Integer.MIN_VALUE)
                return 0;
        }
        return (int) rev;
    }
}