7 - Reverse Integer

最新推荐文章于 2020-04-04 08:04:12 发布

绿水兰田

最新推荐文章于 2020-04-04 08:04:12 发布

阅读量70

点赞数

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

本文链接：https://blog.csdn.net/LvShuiLanTian/article/details/95179583

版权

leetcode 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

Problem

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: [−2³¹, 2³¹− 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

Code

public class Solution {
    public int reverse(int x) {
        long ret = 0, flag = 1, xx = x;
        if (xx < 0) {
            xx = -xx;
            flag = -1;
        }
        while (xx != 0) {
            int t = (int) (ret * 10 + xx % -10);
            if (t / 10 < ret) {
                return 0;
            }
            ret = t;
            xx = xx / 10;
        }
        return (int) (ret * flag);
    }
}