leetcode记录7.Reverse Integer

leetcode记录7.Reverse Integer

#
# @lc app=leetcode id=7 lang=python
#
# [7] Reverse Integer
#
# https://leetcode.com/problems/reverse-integer/description/
#
# algorithms
# Easy (25.12%)
# Total Accepted:    612.1K
# Total Submissions: 2.4M
# Testcase Example:  '123'
#
# 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.
# 
#
class Solution(object):
    def reverse(self, x):
        """
        :type x: int
        :rtype: int
        """
        reslut = 0
        flag = 1
        if x < 0:
            x = -x
            flag = 0
        while(x != 0):
            reslut = reslut*10 + x % 10
            x = int(x / 10)
        if flag == 0:
            reslut = -reslut
        if reslut < -2**31 or reslut >= 2**31:
            reslut = 0
        return reslut