zoukankan      html  css  js  c++  java
  • 蜗牛慢慢爬 LeetCode 7. Reverse Integer [Difficulty: Easy]

    题目

    Reverse digits of an integer.

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

    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.

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

    翻译

    很简单的整数倒置 需要注意的是符号和范围
    利用Python则很简单

    Hints

    Related Topics: Math

    代码

    Java

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

    Python

    class Solution(object):
        def reverse(self, x):
            sign = 1 if x>=0 else -1
            x = x*sign
            xs = str(x)
            ys = xs[::-1]
            
            y = int(ys)*sign
            if y>2**31-1 or y<-2**31:
                return 0
            return y
                    
    
  • 相关阅读:
    H5实现查看图片和删除图片的效果
    HTTP 状态码(HTTP Status Code)
    HashMap详解(基于JDK 1.8)
    FutureTask详解
    ForkJoin框架详解
    final详解
    磁盘管理之inode与block
    如何在CentOS上安装一个2048小游戏
    Linux帮助手册(man)
    Linux入门-基础命令
  • 原文地址:https://www.cnblogs.com/cookielbsc/p/7481848.html
Copyright © 2011-2022 走看看