LeetCode—reverse-integer(反转整数)—java

138 篇文章 0 订阅
132 篇文章 0 订阅

题目描述

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?

Throw an exception? Good, but what if throwing an exception is not an option? You would then have to re-design the function (ie, add an extra parameter).

题意:反转,注意正负号,注意越界问题。

思路解析

  • 这个题反转主要是使用求余数和除法
  • 但是注意最小值和最大值的情况
  • 使用Math.abs()求绝对值反转数字

代码

public class Solution {
    public int reverse(int x) {
        if(x==Integer.MIN_VALUE)
            return Integer.MIN_VALUE;
        int num = Math.abs(x);
        int res = 0;
        while(num!=0){
            if(res>Integer.MAX_VALUE){
                return x>0?Integer.MAX_VALUE:Integer.MIN_VALUE;
            }
            res = res*10+num%10;
            num /=10;
        }
        return x>0?res:-res;
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值