[勇者闯LeetCode] 7. Reverse Integer
2017-03-05 22:06
369 查看
[勇者闯LeetCode] 7. Reverse Integer
Description
Reverse digits of an integer.Example1: x = 123, return 321
Example2: x = -123, return -321
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.
Information
Tags: MathDifficulty: Easy
Solution
class Solution(object): def reverse(self, x): """ :type x: int :rtype: int """ a = 0 b = x if x > 0 else -x while b: a, b = a * 10 + b % 10, b // 10 if a > 2 ** 31: return 0 return a if x > 0 else -a
相关文章推荐
- LeetCode 7. Reverse Integer(整数反转)
- LeetCode 7. Reverse Integer
- leetcode解题报告7. Reverse Integer
- LeetCode解析-7. Reverse Integer
- 【LeetCode】【Python】【C++】7. Reverse Integer代码实现
- Leetcode-7. Reverse Integer
- leetcode-7. Reverse Integer
- [Leetcode] 7. Reverse Integer 解题报告
- [leetcode]-7. Reverse Integer(C语言)
- Leetcode||7. Reverse Integer
- [LeetCode]7. Reverse Integer
- 【LeetCode】7. Reverse Integer
- LeetCode 7. Reverse Integer
- LeetCode 7. Reverse Integer
- 【leetcode】7. Reverse Integer
- [LeetCode]7. Reverse Integer
- LeetCode 7. Reverse Integer 整数反转
- [勇者闯LeetCode] 13. Roman to Integer
- [LeetCode]--7. Reverse Integer
- Leetcode 7. Reverse Integer