LeetCode刷题-7—— Reverse Integer(反转整数)

链接:

https://leetcode.com/problems/reverse-integer/description/

题目:

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

Example:

Example 1:

Input: 123
Output: 321

Example 2:

Input: -123
Output: -321

Example 3:

Input: 120
Output: 21

Notes:

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.

解析:

  1. 将整数符号记录下
  2. 由于整数无法直接进行操作,所以转化成字符串反转

解答:

class Solution(object):
    def reverse(self, x):
        """
        :type x: int
        :rtype: int
        """

        #s = cmp(x,0)
        s = (x>0) - (x<0)
        r = int(str(s*x)[::-1])
        if r > 2**31:
            return 0
        return s*r
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值