leetcode 7 -- Reverse Integer
2015-05-26 17:13
190 查看
Reverse Integer
题目:Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
题意:
给你一个整型数,要求返回它的反转数,题目说的很清楚了,但是需要注意的一点就是整型溢出的情况,如果溢出我们返回0。
思路:
我偷懒了用python,^_^,先转化为string,然后reverse,判断一下是否溢出即可,注意python是天生可以处理大整数的。
代码:
class Solution: # @param {integer} x # @return {integer} def reverse(self, x): if x < 0: t = str(x) s = t[:0:-1] ret = int(s) if ret > 2**31 or ret < -2**31-1: return 0 else: return -ret elif x > 0: t = str(x) s = t[::-1] ret = int(s) if ret > 2**31 or ret < -2**31-1: return 0 else: return ret else: return 0
相关文章推荐
- leetcode--Reverse Integer
- [LeetCode] Reverse Integer
- LeetCode Problem:Reverse Integer
- LeetCode:Reverse Integer
- LeetCode题解——Reverse Integer
- 【LeetCode】Reverse Integer
- leetcode 007 Reverse Integer
- [leetcode 7] Reverse Integer
- [LeetCode]Reverse Integer
- LeetCode-Reverse Integer
- Leetcode: Reverse Integer
- LeetCode | 7)Reverse Integer
- leetcode--Reverse integer
- [LeetCode] Reverse Integer
- LeetCode-7:Reverse Integer
- 【Leetcode】Reverse Integer
- LEETCODE-Reverse Integer
- LeetCode之7 --- Reverse Integer
- LeetCode--Reverse Integer
- LeetCode——Reverse Integer